Parallel primal-dual methods for the minimum cost flow problem

In this paper we discuss the parallel asynchronous implementation of the classical primaldual method for solving the linear minimum cost network flow problem. Multiple augmentations and price rises are simultaneously attempted starting from several nodes with possibly outdated price and flow information. The results are then merged asynchronously subject to rather weak compatibility conditions. We show that this algorithm is valid, terminating finitely to an optimal solution. We also present computational results using an Encore MULTIMAX that illustrate the speedup that can be obtained by parallel implementation.

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

[2]  Robert G. Busacker,et al.  A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS , 1960 .

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

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

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

[6]  Dimitri P. Bertsekas,et al.  A unified framework for primal-dual methods in minimum cost network flow problems , 1985, Math. Program..

[7]  James H. Patterson,et al.  Portable Programs for Parallel Processors , 1987 .

[8]  James McKenna,et al.  Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks , 1987, JACM.

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

[10]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

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

[12]  Egon Balas,et al.  A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM , 1989 .

[13]  Ravindra K. Ahuja,et al.  Chapter IV Network flows , 1989 .

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

[15]  Dimitri P. Bertsekas,et al.  Parallel synchronous and asynchronous implementations of the auction algorithm , 1991, Parallel Comput..

[16]  Egon Balas,et al.  A parallel shortest augmenting path algorithm for the assignment problem , 1991, JACM.

[17]  Dimitri P. Bertsekas,et al.  Parallel Asynchronous Hungarian Methods for the Assignment Problem , 1993, INFORMS J. Comput..