Now showing items 1-3 of 3

    • Analysis of Linear Programming Relaxations for a Class of Connectivity Problems 

      Goemans, Michel X. (Massachusetts Institute of Technology, Operations Research Center, 1990-11)
      We consider the analysis of linear programming (LP) relaxations for a class of connectivity problems. The central problem in the class is the survivable network design problem - the problem of designing a minimum cost ...
    • A Catalog of Steinger Tress Formulations 

      Goemans, Michel X.; Myung, Young-soo (Massachusetts Institute of Technology, Operations Research Center, 1991-05)
      We present some existing and some new formulations for the Steiner tree and Steiner arborescence problems. We show the equivalence of many of these formulations. In particular, we establish the equivalence between the ...
    • Single Machine Scheduling with Release Dates 

      Goemans, Michel X.; Queyranne, Maurice; Schulz, Andreas S.; Skutella, Martin; Wang, Yaoguang (Massachusetts Institute of Technology, Operations Research Center, 1999-10)
      We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a ...