Operations Research Center Working Papers: Recent submissions
Now showing items 133-135 of 372
-
Network Flow Models for Designing Diameter-Constrained Minimum Spanning and Steiner Trees
(Massachusetts Institute of Technology, Operations Research Center, 2001-08)The Diameter-Constrained Minimum Spanning Tree Problem seeks a least cost spanning tree subject to a (diameter) bound imposed on the number of edges in the tree between any node pair. A traditional multicommodity flow model ... -
Multiclass queueing systems in heavy traffic: an asymptotic approach based on distributional and conservation laws
(Massachusetts Institute of Technology, Operations Research Center, 1993-10)We propose a new approach to analyze multiclass queueing systems in heavy traffic based on what we consider as fundamental laws in queueing systems, namely distributional and conservation laws. Methodologically, we extend ... -
Convergence Conditions for Variational Inequality Algorithms
(Massachusetts Institute of Technology, Operations Research Center, 1993-10)Within the extensive variational inequality literature, researchers have developed many algorithms. Depending upon the problem setting, these algorithms ensure the convergence of (i) the entire sequence of iterates, (ii) ...
