Abstract
In this paper we deal with the solution of the separable convex cost network flow problem. In particular, we propose a parallel asynchronous version of the ∈-relaxation method and we prove theoretically its correctness.
We present two implementations of the parallel method for a shared memory multiprocessor system, and we empirically analyze their numerical performance on different test problems. The preliminary numerical results show a good reduction of the execution time of the parallel algorithm with the respect to the sequential counterpart.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.R. Meyer, “Two-segment separable programming, ” Management Science, vol. 25, pp. 285–295, 1979.
J. Eckstein and M. Fukushima, “Some reformulations and applications of the alternating direction method of multiplies, ” in Large-scale Optimization: State of the Art, W.W. Hager, D.W. Hearn, and P.M. Pardalos (Eds.), Kluwer Scientific, 1994, pp. 119–138.
P.V. Kamesan and R.R. Meyer, “Multipoint methods for separable nonlinear networks, ” Math. Programming Study, vol. 22, pp. 185–205, 1984.
R.T. Rockafellar, Network Flows and Monotropic Optimization, John Wiley and Sons, 1984.
D.P. Bertsekas, P.A. Hosein, and P. Tseng, “Relaxation methods for network flow problems with convex arc costs, ” SIAM J. Control and Optimization, vol. 25, pp. 1219–1243, 1987.
A.V. Karzanov and S.T. McCormick, “Polynomial methods for separable convex optimization in unimodular linear spaces with applications to circulations and co-circulations in networks, ” UBC Report, 94-MSC-001, 1993.
S.T. McCormick and L. Liu, “An experimental implementation of the dual cancel and tighten algorithm for minimum cost network flow, ” in Network Flows and Matching, D.S. Johnson and C.S McGeoch (Eds.)American Mathematical Society DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1993, vol. 12, pp. 247–266.
L.C. Polymenakos, “∈-Relaxation and auction algorithms for the convex cost network flow problem, ” Ph.D. Thesis, Electrical Engineering and Computer Science Department, M.I.T., Cambridge, MA, 1995.
R. De Leone, R.R. Meyer, and A. Zakarian, “An ∈-relaxation algorithm for convex network flow problems, ” Computer Sciences Department, University of Wisconsin, Madison, WI, Technical Report, 1995.
D.P. Bertsekas, L.C. Polymenakos, and P. Tseng, “An ∈-relaxation method for convex network optimization problems, ” SIAM J. on Optimization, vol. 7, pp. 853–870, 1997.
D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall: Englewood Cliffs, N.J., 1989.
X. Li and S. Zenios, “Data-level parallel solution of min-cost network flow problems using ∈-relaxations, ” European Journal of Operational Research, vol. 79, pp. 474–488, 1994.
D.P. Bertsekas and P. Tseng, “Relaxation method for minimum cost ordinary and generalized network flow problems, ” Operations Research, vol. 36, pp. 93–114, 1988.
E. Chajakis and S. Zenios, “Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization, ” Parallel Computing, vol. 17, pp. 873–894, 1991.
P. Beraldi, F. Guerriero, and R. Musmanno, “Parallel algorithms for solving the convex minimum cost flow problem, ” Department of Electronics, Informatics and Systems, University of Calabria, Technical Report PARCOLAB No. 8/96, Dec., 1996.
A.V. Goldberg, “Efficient graph algorithms for sequential and parallel computers, ” Laboratory for Computer Science, M.I.T., Cambridge, MA, Technical Report TR-374, 1987.
A.V. Goldberg and R.E. Tarjan, “Solving minimum cost flow problems by successive approximation, ” Mathematics of Operations Research, vol. 15, pp. 430–466, 1990.
D. Klingman and J. Mote, “Computational analysis of large-scale pure networks, ” presented at the Joint National Meeting of ORSA/TIMS New Orleans, 1987.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Beraldi, P., Guerriero, F. & Musmanno, R. Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem. Computational Optimization and Applications 18, 175–190 (2001). https://doi.org/10.1023/A:1008778622003
Issue Date:
DOI: https://doi.org/10.1023/A:1008778622003