Browsing Operations Research Center by Title
Research and Teaching Output of the MIT Community
- Home
- →
- Operations Research Center
- →
- Browsing Operations Research Center by Title
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing Operations Research Center by Title
-
(Massachusetts Institute of Technology, Operations Research Center, 1987)
-
(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 ...
-
(Massachusetts Institute of Technology, 2006)(cont.) We first address the complexity of finding an optimal minimum cost solution to a congestion game. We consider both network and general congestion games, and we examine several variants of the problem concerning the ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1988-08)Not Available
-
(Massachusetts Institute of Technology, Operations Research Center, 1983)
-
(Massachusetts Institute of Technology, Operations Research Center, 1990-01)For a network of G/oo service facilities, the transient joint distribution of the facility populations is found to have a simple Poisson product form with simple explicit formula for the means. In the network it is assumed ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1998)
-
(Massachusetts Institute of Technology, 2001)
-
(Massachusetts Institute of Technology, Operations Research Center, 1971-06)Abstract not available
-
(Massachusetts Institute of Technology, 2001)A practical approach for solving computationally intractable problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computational time. An improvement ...
-
(Massachusetts Institute of Technology, 2010)This thesis presents new methods for exploring data using visualization techniques. The first part of the thesis develops a procedure for visualizing the sampling variability of a plot. The motivation behind this development ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1988)
-
(Massachusetts Institute of Technology, Operations Research Center, 1991)
-
(Massachusetts Institute of Technology, 2006)We consider in this thesis the problem of pricing American Put Options in a model-free framework where we do not make any assumptions about the price dynamics of the underlying except those implied by the no-arbitrage ...
-
(Massachusetts Institute of Technology, 2007)We propose a novel robust optimization technique, which is applicable to nonconvex and simulation-based problems. Robust optimization finds decisions with the best worst-case performance under uncertainty. If constraints ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1978-11)Not Available
-
(Massachusetts Institute of Technology, Operations Research Center, 1995-06)We introduce nonlinear formulations of the multiway cut and multicut problems. By simple linearizations of these formulations we derive several well known formulations and valid inequalities as well as several new ones. ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1973)
-
(Massachusetts Institute of Technology, Operations Research Center, 1982-09)Not Available
-
(Massachusetts Institute of Technology, Operations Research Center, 2000-02)In [9], Maniezzo and Mingozzi study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure, ...
Browse
My Account
MIT-Mirage