Abstract
Two massively parallel algorithms for large scale linear and convex quadratic network flow problems are proposed and studied. The methods are based on the alternating step method for monotropic programming. The original network flow problem is decomposed in simple subproblems involving only few variables for which solution in closed form exists. Computational results obtained on the CRAY T3D show that the methods hold the promise of solving extremely large size problems.
This work was supported by CNR Grant n. 95.00732.CT01 and by a grant from CINECA
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Bertsekas and J. Tsitsiklis, “Parallel and Distributed Computation.” Prentice Hall, Englewood Cliffs, New Jersey, 1989.
R. De Leone, R. Meyer and S. Kontogiogis, “Alternating direction splittinngs for block-angular parallel optimization”. Technical Report 1217, University of Wisconsin, Computer Sciences Dept., February 1994. Submitted to Journal of Optimization Theory and Applications.
R. De Leone, R. Meyer, S. Kontogiogis, A. Zakarian and G. Zakeri, “Coordination in coarse—grain decomposition”. SIAM Journal on Optimization, 4(4):777–793, November 1994.
J. Eckstein, “Splitting methods for monotone operators with applications to parallel optimization”. Massachussetts Institute of Technology, Department of Civil Engineering, 1989.
J. Eckstein, “The alternating step method for monotropic programming on the Connection Machine CM—2”. ORSA Journal on Computing, 5(1):293–318, 1993.
J. Eckstein and B.P. Bertsekas, “On the Douglas—Rachford splitting method and the proximal point method for maximal monotone operators”. Mathematical Programming, Series A, 55(3):293–318, 1992.
R. Glowinski and P. Le Tallec, “Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics”. Society for Industrial and Applied Mathematics, 1989.
S. Kontogiorgis, “Alternating Direction Methods for the Parallel Solution of Large-scale Block-structured Optimization Problems”, University of Wisconsin — Madison, Department of Computer Sciences, 1994.
D. Klingman, A. Napier and J. Stutz, “NETGEN-A program for Generating Large-Scale (Un)capacitated Assignment, Transportation, and Minimum Cost Network Problems”. Management Science, 20:814–822, 1974.
P.L. Lions and B. Mercier, “Splitting Algorithms for the Sum of Two Nonlinear Operators”. SIAM Journal on Numerical Analusis, 16:964–979, 1979.
S.A. Zenios and R.A. Lasken, “Nonlinear Network Optimization on a Massively Parallel Connection Machine”. Annals of Operation Research, 14:147–165, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this chapter
Cite this chapter
De Leone, R., Merelli, E., Sara, B. (1996). Massively Parallel Solution of Large Scale Network Flow Problems. In: Di Pillo, G., Giannessi, F. (eds) Nonlinear Optimization and Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0289-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-4899-0289-4_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-0291-7
Online ISBN: 978-1-4899-0289-4
eBook Packages: Springer Book Archive