Simple Generalized Maximum Flow Algorithms
- 18 June 1998
- book chapter
- Published by Springer Nature
- p. 310-324
- https://doi.org/10.1007/3-540-69346-7_24
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation ProblemMathematics of Operations Research, 1997
- A Faster Combinatorial Algorithm for the Generalized Circulation ProblemMathematics of Operations Research, 1996
- New algorithms for generalized network flowsMathematical Programming, 1994
- Combinatorial Algorithms for the Generalized Circulation ProblemMathematics of Operations Research, 1991
- Netform Modeling and ApplicationsInterfaces, 1990
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- Finding minimum-cost circulations by canceling negative cyclesJournal of the ACM, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Generalized Networks: A Fundamental Computer-Based Planning ToolManagement Science, 1978
- On the equivalence of some generalized network problems to pure network problemsMathematical Programming, 1973