Advanced Search
DSpace@MIT

Browsing Operations Research Center by Title

Research and Teaching Output of the MIT Community

Browsing Operations Research Center by Title

Sort by: Order: Results:

  • Schulz, Andreas S.; Möhring, Rolf H.; Stork, Frederik; Uetz, Marc (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, ...
  • 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 ...
  • Shapiro, Jeremy F., 1939- (Massachusetts Institute of Technology, Operations Research Center, 1975-03)
    Not Available
  • Schaack, Christian; Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1985-02)
    Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. Service times are negative exponential. In order to save available servers for higher priority customers, arriving customers of each lower ...
  • Schaack, Christian; Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1985-05)
    Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. The number of servers requested by an arrival has a known probability distribution. Service times are negative exponential. In order to ...
  • Freund, Robert M.; Ordóñez, Fernando, 1970- (Massachusetts Institute of Technology, Operations Research Center, 2003-02)
    The purpose of this paper is to extend, as much as possible, the modern theory of condition numbers for conic convex optimization: z* := minz ctx s.t. Ax - b Cy C Cx , to the more general non-conic format: z* := minx ctx ...
  • Nguyen, Viên (Massachusetts Institute of Technology, Operations Research Center, 1995)
  • Larson, Richard C., 1943-; Berliner, Leni S. (Massachusetts Institute of Technology, Operations Research Center, 1979-12)
  • Wagner, Michael R. (Michael Robert), 1978- (Massachusetts Institute of Technology, 2006)
    In this thesis we study online optimization problems in routing and scheduling. An online problem is one where the problem instance is revealed incrementally. Decisions can (and sometimes must) be made before all information ...
  • Lu, Xin, Ph. D. Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, 2013)
    In this thesis, we study online optimization problems in routing and allocation applications. Online problems are problems where information is revealed incrementally, and decisions must be made before all information is ...
  • Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1973-01)
  • Nielson, Soren S.; Zenios, Stavros A. (Massachusetts Institute of Technology, Operations Research Center, 1990-11)
    We develop an algorithm for solving nonlinear two-stage stochastic problems with network recourse. The algorithm is based on the framework of row-action methods. The problem is formulated by replicating the first-stage ...
  • Tan, Barli; Gershwin, Stanley B. (Massachusetts Institute of Technology, Operations Research Center, 2001-05)
    We study a manufacturing firm that builds a product to stock to meet a random demand. If there is a positive surplus of finished goods, the customers make their purchases without delay and leave. If there is a backlog, the ...
  • Hoesel, Stan Van; Wagelmans, Albert (Massachusetts Institute of Technology, Operations Research Center, 1991-08)
    An important special case of the economic lot-sizing problem is the one in which there are no speculative motives to hold inventory, i.e., the marginal cost of producing one unit in some period plus the cost of holding it ...
  • Haimovich, Mordecai (Massachusetts Institute of Technology, Operations Research Center, 1985-10)
    A conjecture by Stein [1], proposing a probabilistic limit result for the shortest possible route of a bus that has to transfer passengers between random locations in some region of the plane, is refuted.- The existence ...
  • Freund, Robert M. (Massachusetts Institute of Technology, Operations Research Center, 2004-10)
    There is a natural norm associated with a starting point of the homogeneous self-dual (HSD) embedding model for conic convex optimization. In this norm two measures of the HSD model’s behavior are precisely controlled ...
  • Bertsimas, Dimitris J.; Nakazato, Daisuke (Massachusetts Institute of Technology, Operations Research Center, 1990)
  • Bienstock, Daniel; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1985)
  • Van Hoesel, Stan; Wagelmans, Albert (Massachusetts Institute of Technology, Operations Research Center, 1991-09)
    In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear objective function. After an optimal solution has been determined for a given cost vector, one may want to know how much each ...
  • Magnanti, Thomas L.; Perakis, Georgia (Massachusetts Institute of Technology, Operations Research Center, 1993-05)
    In this paper, we establish global convergence results for projection and relaxation algorithms for solving variational inequality problems, and for the Frank-Wolfe algorithm for solving convex optimization problems defined ...
MIT-Mirage