An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm

This publication has 26 references indexed in Scilit:

• On implementing push-relabel method for the maximum flow problem
  Published by Springer Nature ,1995
• An empirical study of Min cost flow algorithms
  Published by American Mathematical Society (AMS) ,1993
• Goldberg’s algorithm for maximum flow in perspective: a computational study
  Published by American Mathematical Society (AMS) ,1993
• On the computational behavior of a polynomial-time network flow algorithm
  Mathematical Programming, 1992
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
  Mathematical Methods of Operations Research, 1989
• An improved primal simplex variant for pure processing networks
  ACM Transactions on Mathematical Software, 1989
• Chapter IV Network flows
  Published by Elsevier ,1989
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
  Operations Research, 1988
• Distributed relaxation methods for linear network flow problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
  Management Science, 1977