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, 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, ...
-
(Massachusetts Institute of Technology, 2007)We study three capacity expansion problems in contemporary long distance telecommunication networks. The first two problems, motivated by a major long distance provider, address capacity expansion in national hybrid long ...
-
(Massachusetts Institute of Technology, 2010)Poor management of the patient flow in intensive care units (ICUs) causes service rejections and presents significant challenges from the standpoint of capacity planning and management in ICUs. This thesis reports on the ...
-
The case for coordination : equity, efficiency and passenger impacts in air traffic flow management (Massachusetts Institute of Technology, 2010)In this thesis, we develop multi-resource integer optimization formulations for coordinating Traffic Flow Management (TFM) programs with equity considerations. Our multi-resource approaches ignore aircraft connectivity ...
-
(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 ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1981)
-
(Massachusetts Institute of Technology, 2009)In the first part, we study the problem of minimizing a separable concave function over a polyhedron. We assume the concave functions are nonnegative nondecreasing on R+, and the polyhedron is in RI' (these assumptions can ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1982-03)We introduce a transportation equilibrium model that simultaneously predicts trip generation, trip distribution, modal split, and traffic assignment by algorithms that are guaranteed to converge to an equilibrium and are ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1986)
-
(Massachusetts Institute of Technology, Operations Research Center, 2002-07)We study a generic minimization problem with separable non-convex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed integer programming formulations each approximates the ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1978-07)This paper considers a one-product, one-machine production/inventory probelm. Demand requests for the product are governed by a Poisson process with demand size being an exponential random variable. The production facility ...
-
(Massachusetts Institute of Technology, 2011)The thesis investigates the costs and benefits of free competition as opposed to central regulation to coordinate the incentives of various participants in a market. The overarching goal of the thesis is to decide whether ...
-
(Massachusetts Institute of Technology, 2004)Pricing of a perishable product over a multi-period time horizon is a challenging problem under an oligopolistic market framework. We propose and study a model for multi-period pricing in an oligopolistic market for a ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1973-01)
-
(Massachusetts Institute of Technology, Operations Research Center, 2001)Our concern lies in solving the following convex optimization problem: minimize cx subject to Ax=b, x \in P, where P is a closed convex set. We bound the complexity of computing an almost-optimal solution of this problem ...
-
(Massachusetts Institute of Technology, 2001)
-
(Massachusetts Institute of Technology, Operations Research Center, 2002)The goal of this paper is to develop some computational experience and test the practical relevance of the theory of condition numbers C(d) for linear optimization, as applied to problem instances that one might encounter ...
-
(Massachusetts Institute of Technology, Operations Research Center, 2002-07)We present a practical algorithm for computing the minimum volume n-dimensional ellipsoid that must contain m given points al,...,am C Rn . This convex constrained problem arises in a variety of applied computational ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1984-12)We describe in detail seven distinct areas in both public and private sectors in which a real-time computer-aided dispatch system is applicable to the allocation of scarce resources. Characteristics of a real-time ...
-
(Massachusetts Institute of Technology, 2005)We study the transient dynamics of a partially observed, infinite server queue fed with a Poisson arrival process whose controlled rate is changed at discrete points in time. More specifically, we define a state that ...
Browse
My Account
MIT-Mirage