Solving difficult multicommodity problems with a specialized interior-point algorithm

Annals of Operations Research

Volumn 124, Issue 1-4, 2003, Pages 35-48

  Castro, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

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

Indexed keywords

EID: 3542996935     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000004761.99649.a5     Document Type: Article

References (29)

1. Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows. New York: Prentice Hall.
2. Ali, A. and J.L. Kennington. (1977). "Mnetgen Program Documentation." Technical Report 77003, Department of Ind. Eng. and Operations Research, Southern Methodist University, Dallas.
3. Bienstock, D. (1999). "Approximately Solving Large-Scale Linear Programs. I: Strengthening Lower Bounds and Accelerating Convergence." CORC Report 1999-1, Columbia University, New York.
4. Bixby, R.E., M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling. (2000). "MIP: Theory and Practice - Closing the Gap." In M.J.D. Powell and S. Scholtes (eds.), System Modelling and Optimization. Methods, Theory and Applications. Dordrecht: Kluwer, pp. 19-49.
5. Castro, J. (2000a). "A Specialized Interior-Point Algorithm for Multicommodity Network Flows." SIAM Journal on Optimization 10(3), 852-877.
6. Castro, J. (2000b). "Computational Experience with a Parallel Implementation of an Interior-Point Algorithm for Multicommodity Flows." In M.J.D. Powell and S. Scholtes (eds.), System Modelling and Optimization. Methods, Theory and Applications. Dordrecht: Kluwer, pp. 79-95.
7. Castro, J. and A. Frangioni. (2001). "A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows." In J.M. Palma, J. Dongarra, and V. Hernández (eds.), Vector and Parallel Processing, Lecture Notes in Computer Sciences, Vol. 1981. Berlin: Springer, pp. 301-315.
8. Castro, J. and N. Nabona. (1996). "An Implementation of Linear and Nonlinear Multicommodity Network Flows." European Journal of Operations Research 92, 37-53.
9. Carolan, W.J., J.E. Hill, J.L. Kennington, S. Niemi, and S.J. Wichmann. (1990). "An Empirical Evaluation of the KORBX Algorithms for Military Airlift Applications." Operations Research 38, 240-248.
10. Chardaire, P. and A. Lisser. (1999). "Simplex and Interior Point Specialized Algorithms for Solving Non-Oriented Multicommodity Flow Problems." To appear in Operations Research.
11. Chardaire, P. and A. Lisser. (2002). "Minimum Cost Multicommodity Flow." In M. Pardalos and M. Resende (eds.), Handbook of Applied Optimization. Oxford: Oxford University Press, pp. 404-422.
12. Frangioni, A. (1997). "Dual Ascent Methods and Multicommodity Flows." Ph.D. Thesis TD 5/97, Dip. di Informatica, Univ. di Pisa.
13. Frangioni, A. and G. Gallo. (1999). "A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min Cost Flow Problems." INFORMS Journal on Computing 11(4), 370-393.
14. Goffin, J.-L., J. Gondzio, R. Sarkissian, and J.-P. Vial. (1996). "Solving Nonlinear Multicommodity Flow Problems by the Analytic Center Cutting Plane Method." Mathematical Programming 76, 131-154.
15. Goldberg, A.V., J.D. Oldham, S. Plotkin, and C. Stein. (1998). "An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow." In R.E. Bixby, E.A. Boyd, and R.Z. Ríos-Mercado (eds.), Proceedings of the 6th International Integer Programming and Combinatorial Optimization Conference. Lecture Notes in Computer Sciences, Vol. 1412. Berlin: Springer.
16. Golub, G.H. and C.F. Van Loan. (1996). Matrix Computations, 3rd. ed. Baltimore, MD: Johns Hopkins University Press.
17. Gondzio, J. (1996). "Multiple Centrality Corrections in a Primal-Dual Method for Linear Programming." Computational Optimization and Applications 6, 137-156.
18. Gondzio, J. and M. Makowski. (1995). "Solving a Class of LP Problems with a Primal-Dual Logarithmic Barrier Method." European Journal of Operations Research 80, 184-192.
19. Grigoriadis, M.D. and L.G. Khachiyan. (1995). "An Exponential-Function Reduction Method for Block-Angular Convex Programs." Networks 26, 59-68.
20. ILOG CPLEX. (1999). ILOG CPLEX 6.5 Reference Manual Library. ILOG.
21. Kamath, A.P., N.K. Karmarkar, and K.G. Ramakrishnan. (1993). "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, pp. 116-122.
22. Mamer, J. and R. McBride. (2000). "A Decomposition Bases Pricing Procedure for Large Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem." Management Science 46, 693-709.
23. McBride, R.D. (1998). "Progress Made in Solving the Multicommodity Flow Problem." SIAM Journal on Optimization 8, 947-955.
24. Mehrotra, S. (1992). "On the Implementation of a Primal-Dual Interior Point Method." SIAM Journal on Optimization 2, 575-601.
25. Ng, E. and B.W. Peyton. (1993). "Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers." SIAM Journal on Scientific Computing 14, 1034-1056.
26. Portugal, L., M.G.C. Resende, G. Veiga, G., and J. Júdice. (1997). "A Truncated Interior-Point Method for the Solution of Minimum Cost Flow Problems on an Undirected Multicommodity Flow Network." In Proceedings of First Portuguese National Telecommunications Conference, pp. 381-384 (in Portuguese).
27. Resende, M.G.C. and G. Veiga. (1993). "An Implementation of the Dual Affine Scaling Algorithm for Minimum Cost Flow on Bipartite Uncapacitated Networks." SIAM Journal on Optimization 3, 516-537.
28. Schultz, G.L. and R.R. Meyer. (1991). "An Interior Point Method for Block Angular Optimization." SIAM Journal on Optimization 1, 583-602.
29. Wright, S.J. (1996). Primal-Dual Interior-Point Methods. Philadelphia, PA: SIAM.