A strongly polynomial minimum cost circulation algorithm
- 1 September 1985
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 5 (3), 247-255
- https://doi.org/10.1007/bf02579369
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Primal-Dual Algorithm for Submodular FlowsMathematics of Operations Research, 1985
- Towards a Genuinely Polynomial Algorithm for Linear ProgrammingSIAM Journal on Computing, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- An Out-of-Kilter Method for Minimal-Cost Flow ProblemsJournal of the Society for Industrial and Applied Mathematics, 1961
- Monotone networksProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1960