Operations Research Center Working Papers: Recent submissions

Now showing items 109-111 of 372

    • Strong Formulations for Network Design Problems with Connectivity Requirements 

      Magnanti, Thomas L.; Raghavant, S. (Massachusetts Institute of Technology, Operations Research Center, 1999-04)
      The network design problem with connectivity requirements (NDC) models a wide variety of celebrated combinatorial optimization problems including the minimum spanning tree, Steiner tree, and survivable network design ...

    • Valid Inequalities and Facets of the Capacitated Plant Location Problem 

      Leung, Janny M. Y.; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1986-05)
      Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming ...

    • Parametric Linear Programming and Anti-Cycling Pivoting Rules 

      Magnanti, Thomas L.; Orlin, James B., 1953- (Massachusetts Institute of Technology, Operations Research Center, 1985-10)
      The traditional perturbution (or lexicographic) methods for resolving degeneracy in linear programming impose decision rules that eliminate ties in the simplex ratio rule and, therefore,restrict the choice of exiting basic ...