Advanced Search
DSpace@MIT

Browsing Operations Research Center Working Papers by Title

Research and Teaching Output of the MIT Community

Browsing Operations Research Center Working Papers by Title

Sort by: Order: Results:

  • A Dual Ascent Procedure for Large Scale Uncapacitated Network Design 
    Balakrishnan, Anantaram; Magnanti, Thomas L.; Wong, Richard T. (Massachusetts Institute of Technology, Operations Research Center, 1987-05)
    The fixed-charge network design problem arises in a variety of problem contexts including transportation, communication, and production scheduling.We develop a family of dual ascent algorithms for this problem. This approach ...
  • A Dual-Based Algorithm for Multi-Level Network Design 
    Balakrishnan, Anantaram; Magnanti, Thomas L.; Mirchandani, Prakash (Massachusetts Institute of Technology, Operations Research Center, 1991-12)
    Given an undirected network with L possible facility types for each edge, and a partition of the nodes into L levels, the Multi-level Network Design (MLND) problem seeks a fixed cost minimizing design that spans all the ...
  • Duality and sensitivity analysis for fractional programs 
    Bitran, Gabriel R.; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1975)
  • Duality and Sensitivity Analysis for Fractional Programs (REVISED) 
    Bitran, Gabriel R.; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1975-04)
    In this paper, we consider algorithms, duality and sensitivity analysis for optimization problems, called fractional, whose objective function is the ratio of two real valued functions. We discuss a procedure suggested by ...
  • Duality Based Characterizations of Efficient Facets 
    Bitran, Gabriel R.; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1979-10)
    Most practical applications of multicriteria decision making can be formulated in terms of efficient points determined by preference cones with polyhedral closure. Using linear approximations and duality from mathematical ...
  • Due-date setting and priority sequencing in a multiclass M/G/1 queue 
    Wein, Lawrence M.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1988)
  • Dynamic Bundle Methods: Application to Combinatorial Optimization 
    Belloni, Alexandre; Sagastizabal, Claudia (Massachusetts Institute of Technology, Operations Research Center, 2004-06)
    Lagrangian relaxation is a popular technique to solve difficult optimization problems. However, the applicability of this technique depends on having a relatively low number of hard constraints to dualize. When there are ...
  • Dynamic Ground-Holding Policies for a Network of Airports 
    Vranas, Peter B.; Bertsimas, Dimitris J.; Odoni, Amedeo R. (Massachusetts Institute of Technology, Operations Research Center, 1992-06)
    The yearly congestion costs in the US airline industry are estimated to be of the order of $2 billion. In [6] we have introduced and studied generic integer programming models for the static multi-airport ground holding ...
  • A dynamic optimization model of depletable resources 
    Modiano, Eduardo Marco; Shapiro, Jeremy F., 1939- (Massachusetts Institute of Technology, Operations Research Center, 1979)
  • Dynamic Pricing: A learning Approach 
    Bertsimas, Dimitris J.; Perakis, Georgia (Massachusetts Institute of Technology, Operations Research Center, 2001-08)
    We present an optimization approach for jointly learning the demand as a functionof price, and dynamically setting prices of products in an oligopoly environment in order to maximize expected revenue. The models we consider ...
  • Dynamic Scheduling of a Production/Inventory System with By-Products and Random Yield 
    Ou, Jihong; Wein, Lawrence M. (Massachusetts Institute of Technology, Operations Research Center, 1991-05)
    Motivated by semiconductor wafer fabrication, we consider a scheduling problem for a single-server multiclass queue. A single workstation fabricates semiconductor wafers according to a variety of different processes, where ...
  • Economic Lot-Sizing with Start-up Costs: The Convex Hull 
    Van Hoesel, C. P. M.; Wagelmans, Albert; Wolsey, Laurence A. (Massachusetts Institute of Technology, Operations Research Center, 1991-02)
    A partial description of the convex hull of solutions to the economic lot-sizing problem with start-up costs (ELSS) has been derived recently. Here a larger class of valid inequalities is given and it is shown that these ...
  • The Effect of Removing Accidents Repeaters From the Road 
    Ferreira, Joseph Jr.; Keeney, Ralph L. (Massachusetts Institute of Technology, Operations Research Center, 1971-12)
    In newspaper editorials, public commentaries and the like, licensing authorities are often advised to solve the "accident problem" by taking the "nut behind the wheel" off the road. This paper uses six-year driver records ...
  • The Effect of the 18-Year Old Drinking Age on Auto Accidents 
    Cucchiaro, Stephen; Ferreira, Joseph Jr.; Sicherman, Alan (Massachusetts Institute of Technology, Operations Research Center, 1974-05)
    The effect of Massachusetts' reduced drinking age on auto accidents is examined by employing an interrupted time series analysis of monthly accident data covering the period January, 1969, through September 1973. The data ...
  • Efficient Computation of Probabilities of Events Described by Order Statistics and Applications to Queue Inference 
    Jones, Lee K.; Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1994-03)
    This paper derives recursive algorithms for efficiently computing event probabilities related to order statistics and applies the results in a queue inferencing setting. Consider a set of N i.i.d. random variables in [0, ...
  • Efficient Computation of Probabilities of Events Described by Order Statistics and Application to a Problem of Queues 
    Jones, Lee K.; Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1991-05)
    Consider a set of N i.i.d. random variables in [0, 1]. When the experimental values of the random variables are arranged in ascending order from smallest to largest, one has the order statistics of the set of random ...
  • An Efficient Model for Planning Bus Routes in Communities with Populations Between 20,000 and 250,000 
    Hauser, John R. (Massachusetts Institute of Technology, Operations Research Center, 1973-11)
    The paper discusses a flexible, inexpensive, interactive computer model specifically designed to act as an aid for planning routes for conventional bus systems in communities with populations between 20,000 and 250,000. ...
  • Efficient reliability computation of some highly structured networks 
    Bienstock, Daniel; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1985)
  • An Efficient Rescaled Perceptron Algorithm for Conic Systems 
    Belloni, Alexandre; Freund, Robert M.; Vempala, Santosh (2006-09-22)
  • Equilibration operators for the solution of constrained matrix problems 
    Nagurney, Anna; Robinson, Alan; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1989)
MIT-Mirage