A generic auction algorithm for the minimum cost network flow problem
- 1 November 1993
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 2 (3) , 229-259
- https://doi.org/10.1007/bf01299450
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Reverse Auction and the Solution of Inequality Constrained Assignment ProblemsSIAM Journal on Optimization, 1993
- Auction algorithms for network flow problems: A tutorial introductionComputational Optimization and Applications, 1992
- An Auction Algorithm for Shortest PathsSIAM Journal on Optimization, 1991
- Parallel synchronous and asynchronous implementations of the auction algorithmParallel Computing, 1991
- The auction algorithm for the transportation problemAnnals of Operations Research, 1989
- The auction algorithm: A distributed relaxation method for the assignment problemAnnals of Operations Research, 1988
- The relax codes for linear minimum cost network flow problemsAnnals of Operations Research, 1988
- Dual coordinate step methods for linear network flow problemsMathematical Programming, 1988
- Distributed Asynchronous Relaxation Methods for Linear Network Flow ProblemsIFAC Proceedings Volumes, 1987
- Distributed relaxation methods for linear network flow problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986