An auction algorithm for the max-flow problem

We propose a new algorithm for the max-flow problem. It consists of a sequence of augmentations along paths constructed by an auction-like algorithm. These paths are not necessarily shortest, that is, they need not contain a minimum number of arcs. However, they can be found typically with much less computation than the shortest augmenting paths used by competing methods. Our algorithm outperforms these latter methods as well as state-of-the-art preflow-push algorithms by a very large margin in tests with standard randomly generated problems.

[1]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

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

[3]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[4]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[5]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[6]  A. V. Karzanov,et al.  Determining the maximal flow in a network by the method of preflows , 1974 .

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

[8]  Uzi Vishkin,et al.  An O(n² log n) Parallel MAX-FLOW Algorithm , 1982, J. Algorithms.

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

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

[11]  Donald Goldfarb,et al.  A computational comparison of the dinic and network simplex methods for maximum flow , 1988 .

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

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

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

[15]  Ulrich Derigs,et al.  Implementing Goldberg's max-flow-algorithm — A computational investigation , 1989, ZOR Methods Model. Oper. Res..

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

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

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

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

[20]  Venkat Venkateswaran,et al.  Implementations of the Goldberg-Tarjan Maximum Flow Algorithm , 1991, Network Flows And Matching.

[21]  Richard J. Anderson,et al.  Goldberg's Algorithm for Maximum Flow in Perspective: A Computational Study , 1991, Network Flows And Matching.

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

[23]  D. Bertsekas.  Mathematical Equivalence of the Auction Algorithm for Assignment and the ∊-Relaxation (Preflow-Push) Method for Min Cost Flow , 1994 .

[24]  W. Hager,et al.  Large Scale Optimization : State of the Art , 1993 .

[25]  Dimitri P. Bertsekas,et al.  Polynomial auction algorithms for shortest paths , 1995, Comput. Optim. Appl..