Operations Research Center Working Papers: Recent submissions

Now showing items 244-246 of 372

    • Convergent Duality for the Traveling Salesman Problem 

      Shapiro, Jeremy F., 1939- (Massachusetts Institute of Technology, Operations Research Center, 1989-11)
      A constructive method is presented for optimizing exactly the Traveling Salesman Problem as a sequence of shortest route problems. The method combines group theoretic and Lagrangean relaxation constructions. Key Words: ...

    • On the Fine-Grain Decomposition of Multicommodity Transportation Problems 

      Zenios, Stavros A. (Massachusetts Institute of Technology, Operations Research Center, 1990-11)
      We develop algorithms for nonlinear problems with multicommodity transportation constraints. The algorithms are of the row-action type and, when properly applied,decompose the underlying graph alternatingly by nodes and ...

    • A Note on the Number of Leaves of a Euclidean Minimal Spanning Tree 

      Jaillet, Patrick (Massachusetts Institute of Technology, Operations Research Center, 1990-11)
      We show that the number of vertices of degree k in the Euclidean minimal spanning tree through points drawn uniformly from either the d-dimensional torus or from the d-cube, d > 2, are asymptotically equivalent with ...