Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.P. Bertsekas, “A distributed algorithm for the assignment problem,” Lab. for Information and Decision Systems Working Paper, Massachusetts Inst. Technol., Cambridge, MA, 1979.
D.P. Bertsekas, “Distributed asynchronous relaxation methods for linear network flow problems,” LIDS Report P-1606, Massachusetts Inst. Technol., Cambridge, MA, 1986.
D.P. Bertsekas, “Distributed relaxation methods for linear network flow problems,” in Proc. 25th IEEE Conf. on Decision and Control, Athens, Greece, 1986, pp. 2101–2106.
D.P. Bertsekas, “The auction algorithm: a distributed relaxation method for the assignment problem,” Ann. Oper. Res., vol. 14, pp. 105–123, 1988.
D.P. Bertsekas, “The auction algorithm for shortest paths,” SIAM J. on Optimization, vol. 1, pp. 425–447, 1991.
D.P. Bertsekas, Linear Network Optimization: Algorithms and Codes, MIT Press: Cambridge, MA, 1991.
D.P. Bertsekas, “Auction algorithms for network flow problems: a tutorial introduction,” J. Comput. Optimization and Appl., vol. 1, pp. 7–66, 1992.
D.P. Bertsekas and D.A. Castañon, “The auction algorithm for the minimum cost network flow problem,” Laboratory for Information and Decision Systems Report LIDS-P-1925, Massachusetts Inst. Technol., Cambridge, MA, 1989
D.P. Bertsekas and D.A. Castañon, “The auction algorithm for transportation problems,” Ann. Oper. Res., vol. 20, pp. 67–96, 1989.
D.P. Bertsekas and D.A. Castañon, “Parallel synchronous and asynchronous implementations of the auction algorithm,” Parallel Comput., vol. 17, pp. 707–732, 1991.
D.P. Bertsekas, D.A. Castañon, and H. Tsaknakis, “Reverse auction and the solution of inequality constrained assignment problems,” SIAM J. Optimization, vol. 3, pp. 268–297, 1993.
D.P. Bertsekas and J. Eckstein, “Distributed asynchronous relaxation methods for linear network flow problems,” in Proc. of IFAC '87, Munich, Germany, July 1987.
D.P. Bertsekas and J. Eckstein, “Dual coordinate step methods for linear network flow problems,” Math. Progr., Series B, vol. 42, pp. 203–243, 1988.
D.P. Bertsekas and P. Tseng, “RELAX: A computer code for minimum cost network flow problems,” Ann. Oper. Res., vol. 13, pp. 127–190, 1988.
D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall: Englewood Cliffs, NJ, 1989.
D.A. Castañon, “Reverse auction algorithms for assignment problems,” in Network Flows and Matching, D.S. Johnson and C. McGeoch, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 12, American Mathematical Society, pp. 407–430, 1993.
S.E. Dreyfus, “An appraisal of some shortest-path algorithms,” Oper. Res., vol. 17, pp. 395–412, 1969.
A.V. Goldberg, “Efficient graph algorithms for sequential and parallel computers,” Tech. Report TR-374, Laboratory for Computer Science, Massachusetts Inst. Technol.: Cambridge, MA, 1987.
A.V. Goldberg and R. E. Tarjan, “Solving minimum cost flow problems by successive approximation,” Math. Oper. Res., vol. 15, pp. 430–466, 1990.
J. Kennington and R. Helgason, Algorithms for Network Programming, Wiley: New York, 1980.
D. Klingman, A. Napier, and J. Stutz, “NETGEN—A program for generating large scale (un) capacitated assignment, transportation, and minimum cost flow network problems,” Mgmt. Sci., vol. 20, pp. 814–822, 1974.
X. Li and S.A. Zenios, “Data parallel solutions of min-cost network flow problems using ε-relaxations,” Report 1991-05-20, Dept. of Decision Sciences, The Wharton School, Univ. of Pennsylvania, Philadelphia, 1991.
C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall: Englewood Cliffs, NJ, 1982.
L.C. Polymenakos and D.P. Bertsekas, “Parallel shortest path auction algorithm,” Laboratory for Information and Decision Systems Report LIDS-P-2151, Masachusetts Inst. Techno, Cambridge, MA, 1993; Parallel Computing (to appear).
R.T. Rockafellar, Network Flows and Monotropic Programming, Wiley-Interscience: New York, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bertsekas, D.P., Castañon, D.A. A generic auction algorithm for the minimum cost network flow problem. Comput Optim Applic 2, 229–259 (1993). https://doi.org/10.1007/BF01299450
Issue Date:
DOI: https://doi.org/10.1007/BF01299450