Parallel synchronous and asynchronous implementations of the auction algorithm
- 1 September 1991
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 17 (6-7) , 707-732
- https://doi.org/10.1016/s0167-8191(05)80062-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- 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
- Dual coordinate step methods for linear network flow problemsMathematical Programming, 1988
- A shortest augmenting path algorithm for dense and sparse linear assignment problemsComputing, 1987
- A competitive (dual) simplex method for the assignment problemMathematical Programming, 1986
- The shortest augmenting path method for solving assignment problems — Motivation and computational experienceAnnals of Operations Research, 1985
- Efficient dual simplex algorithms for the assignment problemMathematical Programming, 1985
- A new algorithm for the assignment problemMathematical Programming, 1981
- The alternating basis algorithm for assignment problemsMathematical Programming, 1977
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955