The auction algorithm for the transportation problem
- 1 December 1989
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 20 (1) , 67-96
- https://doi.org/10.1007/bf02216923
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- 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
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow ProblemsOperations Research, 1988
- Distributed Asynchronous Relaxation Methods for Linear Network Flow ProblemsIFAC Proceedings Volumes, 1987
- Solving minimum-cost flow problems by successive approximationPublished by Association for Computing Machinery (ACM) ,1987
- Distributed relaxation methods for linear network flow problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A competitive (dual) simplex method for the assignment problemMathematical Programming, 1986
- A unified framework for primal-dual methods in minimum cost network flow problemsMathematical Programming, 1985
- A new algorithm for the assignment problemMathematical Programming, 1981
- The alternating basis algorithm for assignment problemsMathematical Programming, 1977