Planned maintenance alert  Monday, April 21: DSpace@MIT will undergo maintenance activities that will affect service availability and access to file content. While the service interruptions should be brief, access to file content may take longer to restore. Status updates will be posted to http://3down.mit.edu/.
Browsing Operations Research Center Working Papers by Title

Araque, Jésus Rafael; Hall, Leslie A.; Magnanti, Thomas L.
(Massachusetts Institute of Technology, Operations Research Center, 199011)
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, ...

Goemans, Michel X.; Myung, Youngsoo
(Massachusetts Institute of Technology, Operations Research Center, 199105)
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 ...

Magnanti, Thomas L.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1981)

Safwat, K. N. A.; Magnanti, Thomas L.
(Massachusetts Institute of Technology, Operations Research Center, 198203)
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 ...

Tsitsiklis, John N.; Luo, ZhiQuan; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1986)

Croxton, Keely L.; Gendon, Bernard; Magnanti, Thomas L.
(Massachusetts Institute of Technology, Operations Research Center, 200207)
We study a generic minimization problem with separable nonconvex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed integer programming formulations each approximates the ...

Graves, Stephen C.; Keilson, Julian
(Massachusetts Institute of Technology, Operations Research Center, 197807)
This paper considers a oneproduct, onemachine 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 ...

Magnanti, Thomas L.
(Massachusetts Institute of Technology, Operations Research Center, 197301)

Freund, Robert M. (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 almostoptimal solution of this problem ...

Ordóñez, Fernando, 1970; Freund, Robert M. (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 ...

Sun, Peng; Freund, Robert M.
(Massachusetts Institute of Technology, Operations Research Center, 200207)
We present a practical algorithm for computing the minimum volume ndimensional ellipsoid that must contain m given points al,...,am C Rn . This convex constrained problem arises in a variety of applied computational ...

Lee, IJen; Larson, Richard C., 1943
(Massachusetts Institute of Technology, Operations Research Center, 198412)
We describe in detail seven distinct areas in both public and private sectors in which a realtime computeraided dispatch system is applicable to the allocation of scarce resources. Characteristics of a realtime ...

Freund, Robert M.; Vera, Jorge R.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1997)

Nunez, Manuel A.; Freund, Robert M.
(Massachusetts Institute of Technology, Operations Research Center, 199908)
We present bounds on various quantities of interest regarding the central trajectory of a semidefinite program (SDP), where the bounds are functions of Renegar's condition number C(d) and other naturallyoccurring quantities ...

Nunez, Manuel A.; Freund, Robert M.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1996)

Epelman, Marina A., 1973; Freund, Robert M.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1998)

Epelman, Marina A., 1973; Freund, Robert M. (Massachusetts Institute of Technology, Operations Research Center, 1997)

Berman, Oded; Larson, Richard C., 1943
(Massachusetts Institute of Technology, Operations Research Center, 197807)
The median problem has been generalized to include queueinglike congestion of facilities (which are assumed to have finite numbers of servers). In one statement of the problem, a closest available server is assumed to ...

Magnanti, Thomas L.; Balakrishnan, Anantaram; Mirchandani, Prakash; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 2000)

Bertsimas, Dimitris J.; NinoMora, Jose
(Massachusetts Institute of Technology, Operations Research Center, 199303)
We show that if performance measures in stochastic and dynamic scheduling problems satisfy generalized conservation laws, then the feasible space of achievable performance is a polyhedron called an extended polymatroid ...