Auction algorithms for network flow problems: A tutorial introduction

This paper surveys a new and comprehensive class of algorithms for solving the classical linear network flow problem and its various special cases such as shortest path, max-flow, assignment, transportation, and transhipment problems. The prototype method, from which the other algorithms can be derived, is the auction algorithm for the assignment problem. This is an intuitive method that operates like a rel auction where persons compete for objects by raising their prices through competitive bidding; the prices can be viewed as dual variables. Conceptually, auction algorithms represent a significant departure from the cost improvement idea that underlies primal simplex and dual ascent methods; at any one iteration, they may deteriorate both the primal and the dual cost. Auction algorithms perform very well for several important types of problems, both in theory and in practice, and they are also well suited for parallel computation.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  George J. Minty.  Letter to the Editor—A Variant on the Shortest-Route Problem , 1957 .

[3]  G. Minty.  Monotone networks , 1960, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[4]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[5]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[6]  D. Bertsekas,et al.  A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .

[7]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[8]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[9]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[10]  E. Martins.  An algorithm for ranking paths that may contain cycles , 1984 .

[11]  D. Bertsekas.  A distributed asynchronous relaxation algorithm for the assignment problem , 1985, 1985 24th IEEE Conference on Decision and Control.

[12]  D. Bertsekas.  Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.

[13]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[14]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[15]  Dimitri P. Bertsekas,et al.  Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .

[16]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[17]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[18]  D. Bertsekas.  The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

[19]  Dimitri P. Bertsekas,et al.  Dual coordinate step methods for linear network flow problems , 1988, Math. Program..

[20]  D. Bertsekas,et al.  The auction algorithm for the transportation problem , 1989 .

[21]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[22]  S. N. Maheshwari,et al.  Analysis of Preflow Push Algorithms for Maximum Network Flow , 1988, SIAM J. Comput..

[23]  Dimitri P. Bertsekas,et al.  The auction algorithm for the minimum cost network flow problem , 1989 .

[24]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[25]  Ravindra K. Ahuja,et al.  A Fast and Simple Algorithm for the Maximum Flow Problem , 2011, Oper. Res..

[26]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[27]  J. M. Wein,et al.  Massively parallel auction algorithms for the assignment problem , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[28]  David A. Castañón,et al.  Reverse Auction Algorithms for Assignment Problems , 1991, Network Flows And Matching.

[29]  Lazaros Polymenakos.  Analysis of parallel asynchronous schemes for the auction shortest path algorithm , 1991 .

[30]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[31]  Dimitri P. Bertsekas,et al.  An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..

[32]  Dimitri P. Bertsekas,et al.  Parallel synchronous and asynchronous implementations of the auction algorithm , 1991, Parallel Comput..

[33]  Stavros A. Zenios,et al.  On the Massively Parallel Solution of the Assignment Problem , 1991, J. Parallel Distributed Comput..

[34]  S. Pallottino,et al.  The maximum flow problem: A max-preflow approach , 1991 .

[35]  Jeffery L. Kennington,et al.  Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8 , 1991, INFORMS J. Comput..

[36]  Dimitri P. Bertsekas,et al.  A forward/reverse auction algorithm for asymmetric assignment problems , 1992, Comput. Optim. Appl..

[37]  Dimitri P. Bertsekas,et al.  A generic auction algorithm for the minimum cost network flow problem , 1993, Comput. Optim. Appl..

[38]  Dimitri P. Bertsekas,et al.  Reverse Auction and the Solution of Inequality Constrained Assignment Problems , 1993, SIAM J. Optim..

[39]  E. Martins,et al.  An algorithm for the ranking of shortest paths , 1993 .

[40]  B. L. Schwartz.  A computational analysis of the Auction algorithm , 1994 .

[41]  Dimitri P. Bertsekas,et al.  Parallel Shortest Path Auction Algorithms , 1994, Parallel Comput..

[42]  E. Martins,et al.  A computational improvement for a shortest paths ranking algorithm , 1994 .