Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- 12 October 1993
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 46 (2), 133-165
- https://doi.org/10.1016/0166-218x(93)90025-j
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- Finding minimum-cost circulations by canceling negative cyclesJournal of the ACM, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- An O (n 2 (m + N log n )log n ) min-cost flow algorithmJournal of the ACM, 1988
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- 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