On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
- 31 October 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (7) , 383-387
- https://doi.org/10.1016/0167-6377(91)90039-r
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Use of dynamic trees in a network simplex algorithm for the maximum flow problemMathematical Programming, 1991
- A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) timeMathematical Programming, 1990
- Fast Algorithms for Bipartite Network FlowSIAM Journal on Computing, 1987
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972