A bad network problem for the simplex method and other minimum cost flow algorithms
- 1 December 1973
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 5 (1), 255-266
- https://doi.org/10.1007/bf01580132
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- More pathological examples for network flow problemsMathematical Programming, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal FlowsJournal of the ACM, 1972
- On some techniques useful for solution of transportation network problemsNetworks, 1971
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation ProblemsManagement Science, 1967
- On a Class of Capacitated Transportation ProblemsManagement Science, 1959
- A primal‐dual algorithm for the capacitated Hitchcock problemNaval Research Logistics Quarterly, 1957