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:

  • Inventory planning for low demand items in online retailing 
    Chhaochhria, Pallav (Massachusetts Institute of Technology, 2007)
    A large online retailer strategically stocks inventory for SKUs with low demand. The motivations are to provide a wide range of selections and faster customer fulfillment service. We assume the online retailer has the ...
  • Inverse Optimization: An Application to the Capacitated Plant Location Problem 
    Bitran, Gabriel R.; Sempolinski, Dorothy E.; Shapiro, Jeremy F., 1939- (Massachusetts Institute of Technology, Operations Research Center, 1979-09)
    Inverse optimization refers to the fact that each time a Lagrangean derived from a given mathematical programming problem is solved, it produces an optimal solution to some problem with a different right hand side. This ...
  • Jackson's rule for one-machine scheduling : making a good heuristic better 
    Hall, Leslie A.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1989)
  • Joint pricing and inventory decision for competitive products 
    Ye, Kelly (Kelly Yunqing) (Massachusetts Institute of Technology, 2008)
    We consider the joint pricing and inventory decision problem for a single retailer who orders, stocks and sells multiple products. The products are competitive in nature, e.g., these maybe similar products from multiple ...
  • A Langrangian decomposition approach to weakly coupled dynamic optimization problems and its applications 
    Hawkins, Jeffrey Thomas, 1977- (Massachusetts Institute of Technology, 2003)
    We present a Lagrangian based approach to decoupling weakly coupled dynamic optimization problems for both finite and infinite horizon problems. The main contributions of this dissertation are: (i) We develop methods for ...
  • Large-scale dynamic observation planning for unmanned surface vessels 
    Miller, John V. (John Vaala) (Massachusetts Institute of Technology, 2007)
    With recent advances in research and technology, autonomous surface vessel capabilities have steadily increased. These autonomous surface vessel technologies enable missions and tasks to be performed without the direction ...
  • Large scale geometric location problems. 
    Haimovich, Mordecai; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1985)
  • Large scale geometric location problems (REVISED) 
    Haimovich, Mordecai; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1985)
  • Large scale queueing systems : asymptotics and insights 
    Goldberg, David Alan, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2011)
    Parallel server queues are a family of stochastic models useful in a variety of applications, including service systems and telecommunication networks. A particular application that has received considerable attention in ...
  • A Learning Theory Framework for Sequential Event Prediction and Association Rules 
    Rudin, Cynthia; Letham, Benjamin; Kogan, Eugene; Madigan, David (Massachusetts Institute of Technology, Operations Research Center, 2012-08-29)
  • Learning together better : the structured design of learning teams 
    Timmers, Kendell M. (Kendell MacQueen), 1978- (Massachusetts Institute of Technology, 2004)
    There is a great need among educators for a way to quickly assign teams in large or distance learning classrooms in a manner superior to random assignment or student self-selection. Forming teams based on knowledge of ...
  • A Linear Approximation Approach to Duality in Nonlinear Programming 
    Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1973-04)
    Linear approximation and linear programming duality theory are used as unifying tools to develop saddlepoint, Fenchel and local duality theory. Among results presented is a new and elementary proof of the necessity and ...
  • A linearization and decomposition algorithm for computing urban traffic equilibria 
    Aashtiani, Hedayat Zokaei; Magnanti, Thomas L.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1983)
  • Local energy management through mathematical modeling and optimization 
    Craft David (David Loren), 1973- (Massachusetts Institute of Technology, 2004)
    (cont.) Extensions to the core TOTEM model include a demand charge model, used for making daily optimal control decisions when the electric bill includes a charge based on the monthly maximum power draw. The problem of ...
  • Locating Discretionary Service Facilities II: Maximizing Market Size, Minimizing Inconvenience 
    Berman, Oded; Bertsimas, Dimitris J.; Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1992-11)
    Discretionary service facilities are providers of products and/or services that are purchased by customers who are traveling on otherwise pre-planned trips such as the daily commute. Optimum location of such facilities ...
  • Locating Mobile Servers on a Network with Markovian Processes 
    Berman, Oded; Odoni, Amedeo R. (Massachusetts Institute of Technology, Operations Research Center, 1978-10)
    The median problem has been generalized to the case in which facilities can be moved, at a cost, on the network in response to changes in the state of the network. Such changes are brought about by changes in travel times ...
  • Location Games and Bounds for Median Problems 
    Haimovich, Mordecai; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1985-01)
    We consider a two-person zero-sum game in which the maximizer selects a point in a given bounded planar region, the minimizer selects K points in that region,.and the payoff is the distance from the maximizer's location ...
  • Location of facilities on a stochastic network 
    Mirchandani, Pitu B. (Massachusetts Institute of Technology, Operations Research Center, 1974)
  • Locations of Medians on Stochastic Networks 
    Mirchandani, Pitu B.; Odoni, Amedeo R. (Massachusetts Institute of Technology, Operations Research Center, 1977-10)
    The definition of network medians is extended to the case where travel times on network links are random variables with known discrete probability distributions. Under a particular set of assumptions, it is shown that the ...
  • LOGS an optimization system for logistics planning 
    Northup, W. D.; Shapiro, Jeremy F., 1939-; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1979-10)
MIT-Mirage