Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems

We propose a new class of algorithms for linear cost network flow problems with and without gains. These algorithms are based on iterative improvement of a dual cost and operate in a manner that is reminiscent of coordinate ascent and Gauss-Seidel relaxation methods. We compare our coded implementations of these methods with mature state-of-the-art primal simplex and primal-dual codes, and find them to be several times faster on standard benchmark problems, and faster by an order of magnitude on large, randomly generated problems. Our experiments indicate that the speedup factor increases with problem dimension.

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

[2]  Ellis L. Johnson,et al.  Networks and Basic Solutions , 1966, Oper. Res..

[3]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[4]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[5]  D. Bertsekas,et al.  Steepest Descent for Optimization Problems with Nondifferentiable Cost Functionals , 1971 .

[6]  D. Bertsekas,et al.  A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .

[7]  Gerald L. Thompson,et al.  Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.

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

[9]  Fred Glover,et al.  A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems , 1974 .

[10]  Fred W. Glover,et al.  Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems , 1974, Networks.

[11]  Richard S. Hatch Technical Note - Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms , 1975, Oper. Res..

[12]  Thomas L. Magnanti,et al.  Implementing primal-dual network flow algorithms , 1976 .

[13]  T. L. Magnanti OPTIMIZATION FOR SPARSE SYSTEMS , 1976 .

[14]  Paul J. Schweitzer,et al.  The zero pivot phenomenon in transportation and assignment problems and its computational implications , 1977, Math. Program..

[15]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[16]  John M. Mulvey,et al.  Testing of a large-scale network optimization program , 1978, Math. Program..

[17]  John M. Mulvey,et al.  Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[18]  Norman Zadeh Near-Equivalence of Network Flow Algorithms. , 1979 .

[19]  Ray Wild,et al.  Optimization Algorithms for Networks and Graphs , 1980 .

[20]  Richard V. Helgason,et al.  Algorithms for network programming , 1980 .

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

[22]  Richard S. Barr,et al.  Microdata file merging through large-scale network technology , 1981 .

[23]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[24]  Darwin Klingman,et al.  RECENT DEVELOPMENTS IN COMPUTER IMPLEMENTATION TECHNOLOGY FOR NETWORK FLOW ALGORITHMS , 1982 .

[25]  Leon F. McGinnis,et al.  Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem , 1983, Oper. Res..

[26]  D. Bertsekas,et al.  Relaxation methods for minimum cost network flow problems , 1983 .

[27]  A. Barrett Network Flows and Monotropic Optimization. , 1984 .

[28]  M. D. Grigoriadis,et al.  An efficient implementation of the network simplex method , 1986 .

[29]  Paul Tseng,et al.  Relaxation methods for monotropic programming problems , 1986 .

[30]  D. Bertsekas Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.

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

[32]  Dimitri P. Bertsekas,et al.  Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .

[33]  Paul Tseng,et al.  Relaxation Methods for Linear Programs , 1987, Math. Oper. Res..

[34]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[35]  D. Bertsekas,et al.  Relaxation methods for network flow problems with convex arc costs , 1987 .

[36]  Paul Tseng,et al.  Relaxation methods for problems with strictly convex separable costs and linear constraints , 1987, Math. Program..

[37]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[38]  D. Bertsekas The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

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

[40]  Yves Robert,et al.  Parallel and distributed algorithms , 1989 .

[41]  Paul Tseng,et al.  Relaxation methods for monotropic programs , 1990, Math. Program..