Implementing an LU Factorization for the Embedded Network Simplex Algorithm

Published Online:https://doi.org/10.1287/ijoc.1040.0086

References

  • Ahuja R., Magnanti T., Orlin J.Network Flows (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Barnhart C. Dual ascent methods for large-scale multicommodity flow problems. Naval Res. Logist. (1993) 40:305–324CrossrefGoogle Scholar
  • Barr R., Farhangian K., Kennington J. Networks with side-constraints: An LU factorization update. Annals Soc. Logistics Engineers (1986) 1:66–87Google Scholar
  • Bixby R. Solving real-world linear programs: A decade and more of progress. Oper. Res. (2002) 50:3–15LinkGoogle Scholar
  • Brown G., McBride R. Solving generalized networks. Management Sci. (1984) 30:1497–1523LinkGoogle Scholar
  • Castro J. PPRN 1.0 user’s guide. (1994) . DR 94/06, Department of Statistics and Operations Research, Universidad Politécnica de Catalunya, Barcelona, SpainGoogle Scholar
  • Castro J., Nabona N. Primal-dual interior point method for multicommodity network flow with side-constraints and comparison with alternative methods. (1994) . Department of Statistics and Operations Research, Universidad Politécnica de Catalunya, Barcelona, SpainGoogle Scholar
  • Castro J., Nabona N. An implementation of linear and nonlinear multicommodity network flows. Eur. J. Oper. Res. (1996) 92:37–53CrossrefGoogle Scholar
  • Frangioni A. Dual-ascent methods and multicommodity flow problems. (1997) . Ph.D. thesis, TD 5/97, Università di Pisa-Genova-Udine, Pisa, ItalyGoogle Scholar
  • Grigoriadis M., Khachiyan L. An exponential-function reduction method for block-angular convex programs. Networks (1995) 26:59–68CrossrefGoogle Scholar
  • Hellerman E., Rarick D. Reinversion with the presassigned pivot procedure. Math. Programming (1971) 1:195–216CrossrefGoogle Scholar
  • Kennington J. A primal partitioning code for solving multicommodity network flow problems. (1979) . Technical report 79008, Department of Operations Research, Southern Methodist University, Dallas, TXGoogle Scholar
  • Lustig I., Rothberg E. Gigaflops in linear programming. Oper. Res. Lett. (1996) 18:157–165CrossrefGoogle Scholar
  • Mamer J., McBride R. A decomposition based pricing procedure for large scale linear programs: An application to the linear multicommodity flow problem. Management Sci. (2000) 46:693–709LinkGoogle Scholar
  • Marsten R., Subramanian R., Lustig I., Shanno D. Interior point methods for linear programming: Just call Newton, Lagrange, and Fiacco and McCormick! Interfaces (1990) 20:105–116LinkGoogle Scholar
  • McBride R. Factorization in large-scale linear programming. (1973) . Ph.D. dissertation, Anderson Graduate School of Management, University of California, Los Angeles, Los Angeles, CAGoogle Scholar
  • McBride R. A spike collective dynamic factorization algorithm for the simplex method. Management Sci. (1978) 24:1031–1042LinkGoogle Scholar
  • McBride R. A bump triangular dynamic factorization algorithm for the simplex method. Math. Programming (1980) 18:49–61CrossrefGoogle Scholar
  • McBride R. Solving embedded generalized network problems. Eur. J. Oper. Res. (1985) 21:82–92CrossrefGoogle Scholar
  • McBride R. Progress in solving the multicommodity flow problem. SIAM J. Optim. (1998a) 8:947–955CrossrefGoogle Scholar
  • McBride R. Advances in solving the multicommodity flow problem. Interfaces (1998b) 28:32–41LinkGoogle Scholar
  • McBride R., Mamer J. Solving multicommodity flow problems with an embedded network simplex algorithm. INFORMS J. Comput. (1997) 9:154–163LinkGoogle Scholar
  • Nazareth J.Computer Solution of Linear Programs (1987) (Oxford University Press, New York) Google Scholar
  • Pinar M., Zenios S. Parallel decomposition of multicommodity network flows using a linear-quadratic penalty algorithm. ORSA J. Comput. (1992) 4:235–248LinkGoogle Scholar
  • Schultz G., Meyer R. An interior point method for block angular optimization. SIAM J. Optim. (1991) 1:583–602CrossrefGoogle Scholar
  • Zenios S., Pinar M., Dembo R. A smooth penalty function algorithm for network-structured problems. Eur. J. Oper. Res. (1995) 83:220–236CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.