A strongly polynomial minimum cost circulation algorithm

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1985 English Publisher:Springer Science and Business Media LLCJournal:Combinatorica, volume 5, pages 247-255 (issn: 0209-9683, eissn: 1439-6912,

Copyright policy )

Authors: Éva Tardos;

doi: 10.1007/bf02579369

A strongly polynomial minimum cost circulation algorithm

- Summary
- Subjects
- Metrics

Abstract

A new algorithm is presented for the minimum cost circulation problem. The algorithm is strongly polynomial, that is, the number of arithmetic operations is polynomial in the number of nodes, and is independent of both costs and capacities.

Keywords

strongly polynomial, Analysis of algorithms and problem complexity, strongly polynomial algorithm, minimum cost circulation, Deterministic network models in operations research

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	228
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%