Operations Research Center Working Papers: Recent submissions
Now showing items 247-249 of 372
-
Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant
(Massachusetts Institute of Technology, Operations Research Center, 1990-11)For a sample of points drawn uniformly from either the d-dimensional torus or the d-cube, d > 2, we define a class of random processes with the property of being asymptotically equivalent in expectation in the two models. ... -
Analysis of Linear Programming Relaxations for a Class of Connectivity Problems
(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 ... -
Capacitated Trees, Capacitated Routing, and Associated Polyhedra
(Massachusetts Institute of Technology, Operations Research Center, 1990-11)We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalityconstrained minimal spanning tree problem and the identical customer vehicle routing problem. For each of these problems, ...
