A generic auction algorithm for the minimum cost network flow problem

In this paper we broadly generalize the assignment auction algorithm to solve linear minimum cost network flow problems. We introduce a generic algorithm, which contains as special cases a number of known algorithms, including the ε-relaxation method, and the auction algorithm for assignment and for transportation problems. The generic algorithm can serve as a broadly useful framework for the development and the complexity analysis of specialized auction algorithms that exploit the structure of particular network problems. Using this framework, we develop and analyze two new algorithms, an algorithm for general minimum cost flow problems, called network auction, and an algorithm for thek node-disjoint shortest path problem.

[1]  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..

[2]  Dimitri P. Bertsekas,et al.  Auction algorithms for network flow problems: A tutorial introduction , 1992, Comput. Optim. Appl..

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

[4]  Hossam A. Zaki.  A comparison of two algorithms for the assignment problem , 1995, Comput. Optim. Appl..

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

[6]  T. B. Boffey.  Linear Network Optimization: Algorithms and Codes , 1994 .

[7]  Dimitri P. Bertsekas,et al.  RELAX: a computer code for minimum cost network flow problems , 1985 .

[8]  D. Bertsekas,et al.  Relaxation methods for network flow problems with convex arc costs , 1987 .

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

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

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

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

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

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

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

[16]  Paul Tseng,et al.  Relaxation methods for monotropic programs , 1990, Math. Program..

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

[18]  D. Bertsekas,et al.  The relax codes for linear minimum cost network flow problems , 1988 .

[19]  Dimitri P. Bertsekas,et al.  The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial , 1990 .

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

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

[22]  Richard V. Helgason,et al.  Algorithms for network programming , 1980 .

[23]  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.

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

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

[26]  D. Klingman,et al.  NETGEN - A Program for Generating Large Scale (Un) Capacitated Assignment, Transportation, and Minim , 1974 .

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

[28]  Paul Tseng,et al.  Relaxation Methods for Linear Programs , 1987, Math. Oper. Res..

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

[30]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

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

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

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

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