Minimum cost dynamic flows: The series-parallel case
Authors:
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 329-343
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The quickest flow problemMathematical Methods of Operations Research, 1993
- A survey of dynamic network flowsAnnals of Operations Research, 1989
- A forward network simplex algorithm for solving multiperiod network flow problemsNaval Research Logistics Quarterly, 1986
- Minimum cost flow algorithms for series-parallel networksDiscrete Applied Mathematics, 1985
- Minimum Convex Cost Dynamic Network FlowsMathematics of Operations Research, 1984
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- Maximal, Lexicographic, and Dynamic Network FlowsOperations Research, 1973
- An Algorithm for Universal Maximal Dynamic Flows in a NetworkOperations Research, 1971
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958