The auction algorithm: A distributed relaxation method for the assignment problem
- 1 December 1988
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 14 (1), 105-123
- https://doi.org/10.1007/bf02186476
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Distributed Asynchronous Relaxation Methods for Convex Network Flow ProblemsSIAM Journal on Control and Optimization, 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 distributed asynchronous relaxation algorithm for the assignment problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Signature Methods for the Assignment ProblemOperations Research, 1985
- A unified framework for primal-dual methods in minimum cost network flow problemsMathematical Programming, 1985
- Distributed asynchronous computation of fixed pointsMathematical Programming, 1983
- A new algorithm for the assignment problemMathematical Programming, 1981
- Asynchronous Iterative Methods for MultiprocessorsJournal of the ACM, 1978
- The alternating basis algorithm for assignment problemsMathematical Programming, 1977