A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem

We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow algorithm is faster than the best-known implementation of push-relabel on most of the problem instances within our computational study.

[1]  J. Picard.  Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .

[2]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

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

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

[6]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[7]  L. M. Giannini.  Optimum design of open pit mines , 1991, Bulletin of the Australian Mathematical Society.

[8]  Dorit S. Hochbaum,et al.  The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem , 2008, Oper. Res..

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

[10]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.

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

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

[13]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1998, JACM.

[14]  Ravindra K. Ahuja,et al.  Computational investigations of maximum flow algorithms , 1997 .