Advances in Solving the Multicommodity-Flow Problem

References

• Assad A. Multicommodity network flows: A survey. Networks (1978) 8 1 37 92 Crossref, Google Scholar
• Ahuja R. , Magnanti T. , Orlin J. Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Englewood Cliffs, New Jersey) Google Scholar
• Ali A. , Helgason R. , Kennington J. , Lall H. Computational comparison among three multicommodity network flow algorithms. Operations Research (1980) 28 4 995 1000 Link, Google Scholar
• Barr R. , Farhangian K. , Kennington J. Networks with side constraints: An LU factorization update. Annals of the Society of Logistics Engineers (1987) 1 1 66 87 Google Scholar
• Carolan W. , Hill J. , Kennington J. , Niemi S. , Wichman S. An empirical evaluation of the KORBX algorithms for military airlift applications. Operations Research (1990) 38 2 240 248 Link, Google Scholar
• Castro J. , Nabona N. An implementation of linear and nonlinear multicommodity network flows. European Journal of Operational Research (1996) 92 1 37 53 Crossref, Google Scholar
• Chen S. , Saigal R. A primal algorithm for solving a capacitated network flow problem with additional linear constraints. Networks (1977) 7 1 59 79 Crossref, Google Scholar
• Farvolden J. M. , Powell W. B. , Lustig I. J. A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem. Operations Research (1993) 41 4 669 693 Link, Google Scholar
• Glover F. , Klingman D. The simplex son algorithm, for LP/embedded network problems. Mathematical Programming Study (1981) 15 May 148 176 Crossref, Google Scholar
• Graves G. W. , McBride R. D. The factorization approach to large scale linear programming. Mathematical Programming (1976) 10 1 91 110 Crossref, Google Scholar
• Graves G. W. , McBride R. D. A dynamic factorization algorithm for general large scale linear programming problems. (1974) . paper presented at the ORSA/TIMS National Meeting in San Juan, Puerto Rico Google Scholar
• Kennington J. Solving multicommodity transportation problems using a primal partitioning simplex method. Naval Research Logistics Quarterly (1977) 24 2 309 325 Crossref, Google Scholar
• Kennington J. A survey of linear multicommodity network flows. Operations Research (1978) 26 2 209 236 Link, Google Scholar
• Jones K. L. , Lustig I. J. , Farvolden J. M. , Powell W. B. Multicommodity network flows: The impact of formulation on decomposition. Mathematical Programming (1993) 62 1 95 117 Crossref, Google Scholar
• Lustig I. , Rothberg E. Gigaflops in linear programming. Operations Research Letters (1996) 18 4, August 157 165 Crossref, Google Scholar
• Mamer J. , McBride R. D. A decomposition based pricing procedure for large scale linear programs. (1997) . working paper, University of Southern California Google Scholar
• Marsten R. , Subramanian R. , Lustig I. , Saltzman M. , Shanno D. Interior point methods for linear programming: Just call Newton, Lagrange, and Fiacco and McCormick! Interfaces (1990) 20 4 105 116 Link, Google Scholar
• McBride R. D. Factorization in largescale linear programming. (1973) . Ph D dissertation, University of California, Los Angeles Google Scholar
• McBride R. D. Dynamic generalized upper bounding. Operations Research (1978a) 26 2 365 369 Link, Google Scholar
• McBride R. D. A spike collective dynamic factorization algorithm for the simplex method. Management Science (1978b) 24 10 1031 1042 Link, Google Scholar
• McBride R. D. A bump triangular dynamic factorization algorithm for the simplex method. Mathematical Programming (1980) 18 1 49 61 Crossref, Google Scholar
• McBride R. Solving embedded generalized network problems. European Journal of Operational Research (1985) 21 1 82 92 Crossref, Google Scholar
• McBride R. Progress made in solving the multicommodity flow problem. (1996) . working paper, University of Southern California Google Scholar
• McBride R. , Mamer J. Solving multicommodity flow problems. (1995) . working paper, University of Southern California Google Scholar
• McBride R. , Mamer J. Solving multicommodity flow problems with a primal embedded network simplex algorithm. INFORMS Journal on Computing (1997) 9 2, Spring 154 163 Link, Google Scholar
• Pinar M. , Zenios S. Parallel decomposition of multicommodity network flows using a linear-quadratic penalty-algorithm. ORSA Journal on Computing (1992) 4 3, Summer 235 248 Link, Google Scholar
• Schultz G. , Meyer R. An interior point method for block angular optimization. SIAM Journal on Optimization (1991) 1 4 583 602 Crossref, Google Scholar
• Tomlin J. Minimum cost multicommodity network flows. Operations Research (1966) 14 1 45 51 Link, Google Scholar
• Zenios S. , Pinar M. , Dembo R. A smooth penalty function algorithm for network-structured problems. European Journal of Operational Research (1995) 83 1 220 236 Crossref, Google Scholar