A parallel implementation of an interior-point algorithm for multicommodity network flows

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1981, Issue , 2001, Pages 301-315

  Castro, Jordi ^a   Frangioni, Antonio ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUGATE GRADIENT METHOD; LINEAR SYSTEMS;

COMPUTATIONAL RESULTS; INTERIOR POINT ALGORITHM; MULTI-COMMODITY NETWORK FLOWS; MULTICOMMODITY FLOW PROBLEMS; PARALLEL IMPLEMENTATIONS; POSITIVE DEFINITE; PRECONDITIONED CONJUGATE GRADIENT METHOD; SHARED MEMORY MACHINES;

QUADRATIC PROGRAMMING;

EID: 84957793926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44942-6_25     Document Type: Conference Paper

References (27)

1. Adler, I., Resende, M.G.C., Veiga, G.: An implementation of Karmarkar’s algorithm for linear programming. Math. Prog. 44 (1989) 297–335
2. Andersen, E.D., Andersen, K.D.: A parallel interior-point algorithm for linear programming on a shared memory machine. CORE Discussion Paper 9808 (1998), CORE, Louvain-La-Neuve, Belgium
3. Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation. Prentice- Hall, Englewood Cliffs (1995)
4. Bienstock D.: Approximately solving large-scale linear programs. I: Strengthening lower bounds and accelerating convergence. CORC Report 1999–1 (1999), Columbia University, NY
5. Castro, J.: A specialized interior-point algorithm for multicommodity network flows. SIAM J. on Opt. 10(3) (2000) 852–877
6. Castro, J.: Computational experience with a parallel implementation of an interiorpoint algorithm for multicommodity network flows. In: M. Powell, S. Scholtes (eds.): System Modelling and Optimization. Methods, Theory and Applications. Kluwer, New York (2000) 75–95
7. Cappanera, P., Frangioni, A.: Symmetric and asymmetric parallelization of a costdecomposition algorithm for multi-commodity flow problems. INFORMS J. on Comp., to appear (2000)
8. Coleman, T.F., Czyzyk, J., Sun, C., Wagner, M., Wright, S.J.: pPCx: parallel software for linear programming. Proceedings of the Eight SIAM Conference on Parallel Processing in Scientific Computing, SIAM, March 1997
9. ILOG CPLEX: ILOG Cplex 6.5 Reference Manual Library. ILOG (1999).
10. De Silva, A., Abramson, D.A.: A parallel interior-point method and its application to facility location problems. Computational Optimization and Applications 9(3) (1998) 249–273
11. Dongarra, J.J., Meuer, H.W., Strohmaier, E.: TOP500 supercomputer sites. Technical Report UT-CS-98-404 (1998), Computer Science Dept. University of Tennessee
12. Frangioni, A., Gallo, G.: A bundle type dual-ascent approach to linear multicommodity min cost flow problems. INFORMS J. on Comp. 11(4) (1999) 370–393
13. Gondzio, J., Sarkissian, R., Vial, J.-P.: Parallel implementation of a central decomposition method for solving large scale planning problems. HEC Technical Report 98.1 (1998)
14. Jessup, E.R., Yang, D., Zenios, S.A.: Parallel factorization of structured matrices arising in stochastic programming. SIAM J. on Opt. 4(4) (1994) 833–846
15. Kamath, A.P., Karmarkar, N.K., Ramakrishnan, K.G.: Computational and complexity results for an interior-point algorithm on multicommodity flow problems. Technical Report TR-21-93 (1993), Dip. di Informatica, Universit`a di Pisa, Italy
16. Kontogiorgis, S., De Leone, R., Meyer, R.R.: Alternating directions splitting for block angular parallel optimization. JOTA 90(1) (1996) 1–29
17. Lustig, I.J., Li, G.: An implementation of a parallel primal-dual interior-point method for block-structured linear programs. Computational Optimization and Applications 1 (1992) 141–161
18. Lustig, I.J., Rothberg, E.: Gigaflops in linear programming. O.R. Letters 18(4) (1996) 157–165
19. McBride, R.D.: Advances in Solving the Multicommodity Flow Problem. SIAM J. on Opt. 8(4) (1998) 947–955
20. Medhi, D.: Parallel bundle-based decomposition for large-scale structured mathematical programming problems. Annals of O.R. 22 (1990) 101–127
21. Ng, E., Peyton, B.W.: Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14 (1993) 1034–1056
22. Pinar, M.C., Zenios, S.A.: Parallel decomposition of multicommodity network flows using a linear-quadratic penalty algorithm. ORSA J. on Comp. 4 (1992) 235–249
23. Portugal L, Resende, M.G.C, Veiga, G, Júudice, J.: A truncated interior-point method for the solution of minimum cost flow problems on an undirected multicommodity flow network. Proceedings of First Portuguese National Telecommunications Conference, Aveiro, Portugal (1997) 381–384 (in Portuguese)
24. Rosen, J.B. (ed.): Supercomputers and large-scale optimization: algorithms, software, applications. Annals of O.R. 22 (1990)
25. Silicon Graphics Inc.: C Language Reference Manual (1998)
26. Schultz, G., Meyer, R.: An interior-point method for block-angular optimization. SIAM J. on Opt. 1 (1991) 583–682
27. Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia, PA (1997)