A strongly polynomial minimum cost circulation algorithm
- 989 Downloads
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.
AMS subject classification (1980)68 E 10 68 C 25
Unable to display preview. Download preview PDF.
- R. P. Anstee, A polynomial algorithm forb-matching: an alternative approach,Research Report CORR 83–22, University Waterloo, Waterloo, Ontario, 1983.Google Scholar
- J. Edmonds, Submodular functions, matroids and certain polyhedra, in:Combinatorial Structures and Applications, (R. K. Guy et al. eds.) 1970 Gordon and Breach, New York 67–87.Google Scholar
- H. Röck, Scaling techniques for minimal cost network flows, in:Discrete Structures and Algorithms, (U. Page ed.) 1980, Carl Hanser, München, 181–191.Google Scholar