Elsevier

Journal of Algorithms

Volume 22, Issue 1, January 1997, Pages 1-29
Journal of Algorithms

Regular Article
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm

https://doi.org/10.1006/jagm.1995.0805Get rights and content

Abstract

The scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithms. We study practical implementations of this method. We are especially interested in heuristics which improve real-life performance of the method. Our implementation works very well over a wide range of problem classes. Some heuristics we develop may apply to other network algorithms. Our experimental work on the minimum-cost flow problem motivated theoretical work on related problems.

References (37)

  • R.K. Ahuja et al.

    Network flows

    Optimization. Handbooks in Operations Research and Management Science

    (1989)
  • R.J. Anderson et al.

    Goldberg's algorithm for the maximum flow in perspective: A computational study

  • D. P. Bertsekas, 1986, Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems, Laboratory for...
  • D.P. Bertsekas et al.

    Relaxation methods for minimum cost ordinary and generalized network flow problems

    Oper. Res.

    (1988)
  • R.G. Bland et al.

    An empirical study of min cost flow algorithms

  • R.G. Bland et al.

    On the computational behavior of a polynomial-time network flow algorithm

    Math. Prog.

    (1992)
  • G. Bradley et al.

    Design and implementation of large scale transportation algorithms

    Management Sci.

    (1977)
  • M.D. Chang et al.

    An improved primal simplex variant for pure processing networks

    ACM Trans. Math. Software

    (1989)
  • B. V. Cherkassky,...
  • B. V. Cherkassky, A. V. Goldberg, 1994, On Implementing Push-Relabel Method for the Maximum Flow Problem, Department of...
  • U. Derigs et al.

    Implementing Goldberg's max-flow algorithm—A computational investigation

    ZOR—Methods Models Oper. Res.

    (1989)
  • U. Derigs et al.

    Goldrmf/Goldnet-max-flow program

    Europ. J. Oper Res.

    (1990)
  • R.B. Dial

    Algorithm 360: Shortest path forest with topological ordering

    Commun. ACM

    (1969)
  • L.R. Ford et al.

    Flows in Networks

    (1962)
  • S. Fujishige et al.

    A speculative contraction method for the minimum cost flows: Toward a practical algorithm

  • F. Glover et al.

    Implementation and computational comparison of primal, dual, and primal–dual computer codes for minimum cost network flow problem

    Networks

    (1974)
  • A. V. Goldberg, 1985, A New Max-Flow Algorithm, Laboratory for Computer Science,...
  • A. V. Goldberg, 1987, Efficient Graph Algorithms for Sequential and Parallel...
  • Cited by (299)

    View all citing articles on Scopus

    G. L. NemhauserA. H. G. Rinnooy KanM. J. Todd, Eds.

    *

    Most of this work was done while the author was at the Stanford University Computer Science Department and supported in part by ONR Young Investigator Award N00014-91-J-1855, NSF Presidential Young Investigator Grant CCR-8858097 with matching funds from AT&T and DEC, Stanford University Office of Technology Licensing, and a grant from the Powell Foundation.

    View full text