RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems

The structure of dual ascent methods is particularly well-suited for taking advantage of good initial dual solutions of minimum cost flow problems. For this reason, these methods are extremely efficient for reoptimization and sensitivity analysis. In the absence of prior knowledge of a good initial dual solution, one may attempt to find such a solution by means of a heuristic initialization. RELAX-IV is a minimum cost flow code that combines the RELAX code of [BeT88a], [BeT88b] with an initialization based on a recently proposed auction/sequential shortest path algorithm. This initialization is shown to be extremely helpful in speeding up the solution of difficult problems, involving for example long augmenting paths, for which the relaxation method has been known to be slow. On the other hand, this initialization procedure does not significantly deteriorate the performance of the relaxation method for the types of problems where it has been known to be very fast.

[1]  D. R. Fulkerson,et al.  A primal‐dual algorithm for the capacitated Hitchcock problem , 1957 .

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

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

[4]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

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

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

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

[8]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

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

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

[11]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[12]  Dimitri P. Bertsekas,et al.  Dual coordinate step methods for linear network flow problems , 1988, Math. Program..

[13]  李幼升,et al.  Ph , 1989 .

[14]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

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

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

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

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

[19]  Clifford Stein,et al.  Implementation of a Combinatorial Multicommodity Flow Algorithm , 1991, Network Flows And Matching.

[20]  Mauricio G. C. Resende,et al.  An Efficient Implementation of a Network Interior Point Method , 1991, Network Flows And Matching.

[21]  Dimitri P. Bertsekas,et al.  An auction/sequential shortest path algorithm for the minimum cost network flow problem , 1992 .

[22]  R. Leone,et al.  A modified auction algorithm for the shortest path problem , 1994 .

[23]  D. Bertsekas.  An auction algorithm for the max-flow problem , 1995 .

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