Maximum-throughput dynamic network flows
- 1 October 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 27 (2) , 214-231
- https://doi.org/10.1007/bf02591946
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Maximal, Lexicographic, and Dynamic Network FlowsOperations Research, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Flows in infinite graphsJournal of Combinatorial Theory, 1970
- Transient flows in networks.The Michigan Mathematical Journal, 1959
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958
- Part II ‐ Generalization and analysisNaval Research Logistics Quarterly, 1957
- An algorithm for the minimum number of transport units to maintain a fixed scheduleNaval Research Logistics Quarterly, 1957
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956
- Minimizing the number of tankers to meet a fixed scheduleNaval Research Logistics Quarterly, 1954