A specialized interior-point algorithm for multicommodity network flows

SIAM Journal on Optimization

Volumn 10, Issue 3, 2000, Pages 852-877

  Castro, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Interior point methods; Linear programming; Multicommodity flows; Network programming

Indexed keywords

EID: 0034389613     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498341879     Document Type: Article

References (33)

1. I. ADLER, M.G.C. RESENDE, AND G. VEIGA, An implementation of Karmarkar's algorithm for linear programming, Math. Programming, 44 (1989), pp. 297-335.
2. R.K. AHUJA, T.L. MAGNANTI, AND J.B. ORLIN, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
3. A. ALI, R.V. HELGASON, J.L. KENNINGTON, AND H. LALL, Computational comparison among three multicommodity network flow algorithms, Oper. Res., 28 (1980), pp. 995-1000.
4. A. ALI AND J.L. KENNINGTON, Mnetgen Program Documentation, Technical Report 77003, Department of Industrial Engineering and Operations Research, Southern Methodist University, Dallas, TX, 1977.
5. E.D. ANDERSEN, J. GONDZIO, C. MÉSZÁROS, AND X. XU, Implementation of interior point methods for large scale linear programming, in Interior Point Methods in Mathematical Programming, T. Terlaky, ed., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996, pp. 189-252.
6. J. CASTRO AND N. NABONA, An implementation of linear and nonlinear multicommodity network flows, European J. Oper. Res., 92 (1996), pp. 37-53.
7. W.J. CAROLAN, J.E. HILL, J.L. KENNINGTON, S. NIEMI, AND S.J. WICHMANN, An empirical evaluation of the KORBX algorithms for military airlift applications, Oper. Res., 38 (1990), pp. 240-248.
8. P. CHARDAIRE AND A. LISSER, Simplex and interior point specialized algorithms for solving non-oriented multicommodity flow problems, Oper. Res., accepted subject to revision.
9. I.C. CHOI AND D. GOLDFARB, Solving multicommodity network flow problems by an interior point method, in Large-Scale Numerical Optimization, T.F. Coleman and Y. Li, eds., SIAM, Philadelphia, PA, 1990, pp. 58-69.
10. CPLEX OPTIMIZATION INC., Using the CPLEX Callable Library, Incline Village, NV, 1995.
11. DIMACS, The First DIMACS International Algorithm Implementation Challenge: The Benchmark Experiments, Technical Report, DIMACS, New Brunswick, NJ, 1991.
12. A. FRANGIONI, personal communication, Department of Computer Science, Université di Pisa, Pisa, Italy, 1998.
13. A. FRANGIONI AND G. GALLO, A bundle type dual-ascent approach to linear multicommodity min cost flow problems, INFORMS J. Comput., 11 (1999), pp. 370-393.
14. J.A. GEORGE AND J.W. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
15. J.-L. GOFFIN, J. GONDZIO, R. SARKISSIAN, AND J.-P. VIAL, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Math. Programming, 76 (1996), pp. 131-154.
16. J. GONDZIO AND M. MAKOWSKI, Solving a class of LP problems with a primal-dual logarithmic barrier method, European J. Oper. Res., 80 (1995), pp. 184-192.
17. M.D. GRIGORIADIS AND L.G. KHACHIYAN, An exponential-function reduction method for block-angular convex programs, Networks, 26 (1995), pp. 59-68.
18. A.P. KAMATH, N.K. KARMARKAR, AND K.G. RAMAKRISHNAN, Computational and Complexity Results for an Interior Point Algorithm on Multicommodity Flow Problems, Technical Report TR-21/93, Dip. di Informatica, Univ. di Pisa, Italy, 1993, pp. 116-122.
19. A.P. KAMATH AND O. PALMON, Improved Interior Point Algorithms for Exact and Approximate Solutions of Multicommodity Flow Problems, Technical Report, Dept. of Computer Sciences, Stanford University, Stanford, CA, 1994.
20. S. KAPOOR AND P.M. VAIDYA, Speeding up Karmarkar's algorithm for multicommodity flows, Math. Programming, 73 (1996), pp. 111-127.
21. J.L. KENNINGTON AND R.V. HELGASON, Algorithms for Network Programming, Wiley, New York, 1980.
22. I.J. LUSTIG, R.E. MARSTEN, AND D.F. SHANNO, On implementing Mehrotra's predictor-corrector interior-point method for linear programming, SIAM J. Optim., 2 (1992), pp. 435-449.
23. CS. MÉSZÁROS, The Efficient Implementation of Interior Point Methods for Linear Programming and Their Applications, Ph.D. Thesis, Eötvös Loránd University of Sciences, Budapest, Hungary, 1996.
24. E. NG AND B.W. PEYTON, Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Comput., 14 (1993), pp. 1034-1056.
25. J.M. ORTEGA, Introduction to Parallel and Vector Solution of Linear Systems, Plenum Press, New York, 1988.
26. L. PORTUGAL, M.G.C. RESENDE, G. VEIGA, G., AND J. JÚDICE, A truncated primal-infeasible dual-feasible network interior point method, Networks, 35 (2000), pp. 91-108.
27. L. PORTUGAL, M.G.C. RESENDE, G. VEIGA, G., AND J. JÚDICE, A truncated interior-point method for the solution of minimum cost flow problems on an undirected multicommodity flow network, in Proceedings of the First Portuguese National Telecommunications Conference, Aveiro, Portugal, 1997, pp. 381-384 (in Portuguese).
28. M.G.C. RESENDE AND P. PARDALOS, Interior point algorithms for network flow problems, in Advances in Linear and Integer Programming, J.E. Beasley, ed., Oxford University Press, New York, 1996, pp. 149-189.
29. M.G.C. RESENDE AND G. VEIGA, An implementation of the dual affine scaling algorithm for minimum-cost flow on bipartite uncapacitated networks, SIAM J. Optim., 3 (1993), pp. 516-537.
30. M.G.C. RESENDE, T. TSUCHIYA, AND G. VEIGA, Identifying the optimal face of a network linear program with a globally convergent interior point method, in Large Scale Optimization: State of the Art, W. Hager, D. Hearn, and P. Pardalos, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994, pp. 362-387.
31. G.L. SCHULTZ AND R.R. MEYER, An interior point method for block angular optimization, SIAM J. Optim., 1 (1991), pp. 583-602.
32. S.J. WRIGHT, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, PA, 1996.
33. S. ZENIOS, A smooth penalty function algorithm for network-structured problems, European J. Oper. Res., 83 (1995), pp. 220-236.