More pathological examples for network flow problems
- 1 December 1973
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 5 (1), 217-224
- https://doi.org/10.1007/bf01580122
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- 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
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation ProblemsManagement Science, 1967