Abstract
The auction algorithm is an intuitive method for solving the classical assignment problem. It outperforms substantially its main competitors for important types of problems, both in theory and in practice, and is also naturally well suited for parallel computation. The algorithm represents a significant departure from the cost improvement idea that underlies primal simplex and dual ascent methods; at any one iteration, it may deteriorate both the primal and the dual cost, although in the end it does find an optimal primal solution. We derive the algorithm from first principles, explain its computational properties, and discuss its extensions to transportation and transhipment problems.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bertsekas, D. P., “A Distributed Algorithm for the Assignment Problem”,Lab. for Information and Decision Systems Working Paper, M.I.T., (March).
Bertsekas, D. P., “A Distributed Asynchronous Relaxation Algorithm for the Assignment Problem”, Proc. 24th IEEE Conf. Dec. & Contr., pp. 1703–1704.
Bertsekas, D. P., “Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems”, LIDS Report P-1606, M.I.T., (revision of Nov.).
Bertsekas, D. P., “Distributed Relaxation Methods for Linear Network Flow Problems”, Proceedings of 25th IEEE Conference on Decision and Control, pp. 2101–2106.
Bertsekas, D. P., “The Auction Algorithm: A Distributed Relaxation Method for the Assignment Problem”, Annals of Operations Research, Vol. 14, pp. 105–123.
Bertsekas, D. P., and Castafion, D. A., “The Auction Algorithm for Transportation Problems”, Annals of Operations Research, Vol. 20, pp. 67–96.
Bertsekas, D. P., and Castañon, D. A., “The Auction Algorithm for the Minimum Cost Network Flow Problem”, Laboratory for Information and Decision Systems Report LIDS-P-1925, M.I.T., Cambridge, MA, (November).
Bertsekas, D. P., and Castañon, D. A., “Parallel Synchronous and Asynchronous Implementations of the Auction Algorithm”, Alphatech Report, Burlington,MA, Nov. 1989.
Bertsekas, D. P., and Castañon, D. A., “Parallel Asynchronous Hungarian Methods for the Assignment Problem”, Alphatech Report, Burlington, MA, Jan.1990.
Bertsekas, D. P., and Eckstein, J., “Dual Coordinate Step Methods for Linear Network Flow Problems”, Math. Progr., Series B, Vol. 42, 1988, pp. 203–243.
Bertsekas, D. P., and Tsitsiklis, J. N., Parallel and Distributed Computation:Numerical Methods, Prentice-Hall, Englewood Cliffs, N. J., 1989.
Kempa, D., Kennington, J., and Zaki, H., “Performance Characteristics of the Jacobi and Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8”,Report OR-89–008, Dept. of Mech. and Ind. Eng., Univ. of Illinois, Champaign-Urbana,1989.
Phillips, C, and Zenios, S. A., “Experiences with Large Scale Network Optimization on the Connection Machine”, Report 88–11-05, Dept. of Decision Sciences,The Wharton School, Univ. of Pennsylvania, Phil., Penn., Nov. 1988.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bertsekas, D.P. (1991). The Auction Algorithm for Assignment and Other Network Flow Problems. In: New Trends in Systems Theory. Progress in Systems and Control Theory, vol 7. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0439-8_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0439-8_12
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6760-7
Online ISBN: 978-1-4612-0439-8
eBook Packages: Springer Book Archive