Mathematical Equivalence of the Auction Algorithm for Assignment and the ∊-Relaxation (Preflow-Push) Method for Min Cost Flow
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Auction algorithms for network flow problems: A tutorial introductionComputational Optimization and Applications, 1992
- The maximum flow problem: A max-preflow approachEuropean Journal of Operational Research, 1991
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- 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
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- The auction algorithm: A distributed relaxation method for the assignment problemAnnals of Operations Research, 1988
- Dual coordinate step methods for linear network flow problemsMathematical Programming, 1988