An auction algorithm for the max-flow problem
- 1 October 1995
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 87 (1), 69-101
- https://doi.org/10.1007/bf02192042
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Mathematical Equivalence of the Auction Algorithm for Assignment and the ∊-Relaxation (Preflow-Push) Method for Min Cost FlowPublished by Springer Nature ,1994
- Auction algorithms for network flow problems: A tutorial introductionComputational Optimization and Applications, 1992
- An Auction Algorithm for Shortest PathsSIAM Journal on Optimization, 1991
- The maximum flow problem: A max-preflow approachEuropean Journal of Operational Research, 1991
- Analysis of Preflow Push Algorithms for Maximum Network FlowSIAM Journal on Computing, 1989
- Implementing Goldberg's max-flow-algorithm ? A computational investigationMathematical Methods of Operations Research, 1989
- A Fast and Simple Algorithm for the Maximum Flow ProblemOperations Research, 1989
- A computational comparison of the dinic and network simplex methods for maximum flowAnnals of Operations Research, 1988
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972