A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
- 1 May 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 47 (1) , 353-365
- https://doi.org/10.1007/bf01580869
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- A new approach to the maximum flow problemPublished by Association for Computing Machinery (ACM) ,1986
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- A practicable steepest-edge simplex algorithmMathematical Programming, 1977
- A network simplex methodMathematical Programming, 1976
- 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
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957