Auction algorithms for network flow problems: A tutorial introduction
- 1 October 1992
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 1 (1) , 7-66
- https://doi.org/10.1007/bf00247653
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- An Auction Algorithm for Shortest PathsSIAM Journal on Optimization, 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
- 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
- A shortest augmenting path algorithm for dense and sparse linear assignment problemsComputing, 1987
- An algorithm for ranking paths that may contain cyclesEuropean Journal of Operational Research, 1984
- A new algorithm for the assignment problemMathematical Programming, 1981
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955