Advanced Search
DSpace@MIT

Browsing Theses - Operations Research Center by Title

Research and Teaching Output of the MIT Community

Browsing Theses - Operations Research Center by Title

Sort by: Order: Results:

  • Popescu, Ioana (Massachusetts Institute of Technology, 1999)
  • Rikun, Alexander Anatolyevich (Massachusetts Institute of Technology, 2011)
    This thesis investigates the application of robust optimization in the performance analysis of queueing and inventory systems. In the first part of the thesis, we propose a new approach for performance analysis of queueing ...
  • Demir, Ramazan (Massachusetts Institute of Technology, 2000)
    We develop Approximate Dynamic Programming (ADP) methods to integer programming problems. We describe and investigate parametric, nonparametric and base-heuristic learning approaches to approximate the value function in ...
  • Wang, Hai, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2012)
    The Last Mile Problem (LMP) refers to the provision of travel service from the nearest public transportation node to a home or office. We study the supply side of this problem in a stochastic setting, with batch demands ...
  • Correa, José Rafael, 1975- (Massachusetts Institute of Technology, 2004)
    In this thesis we consider three combinatorial optimization problems. Specifically, we study packing and scheduling questions of relevance in several areas of operations research, including interconnection networks and ...
  • Herold, Thomas Michael (Massachusetts Institute of Technology, 2010)
    Recent decades have seen the development of more advanced sensor and communication systems, with the future certainly holding more innovation in these areas. However, current operations involve "stovepipe" systems in which ...
  • Frumin, Michael S (Massachusetts Institute of Technology, 2010)
    The broad goal of this thesis is to demonstrate the potential positive impacts of applying automatic data to the management and tactical planning of a modern urban railway. Tactical planning is taken here to mean the set ...
  • Bradwick, Matthew E. (Matthew Edward) (Massachusetts Institute of Technology, 2012)
    This thesis considers approaches to influencing population opinions during counterinsurgency efforts in Afghanistan. A discrete time, agent-based threshold model is developed to analyze the propagation of beliefs in the ...
  • Gupta, Shobhit (Massachusetts Institute of Technology, 2006)
    Buyout options allow bidders to instantly purchase at a specified price an item listed for sale through an online auction. A temporary buyout option disappears once a regular bid above the reserve price is made, while a ...
  • Sivaraman, Raghavendran (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 ...
  • Chaiwanon, Wongsakorn (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 ...
  • Fearing, Douglas (Douglas Stephen) (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 ...
  • Williams, Mark J. (Mark John) (Massachusetts Institute of Technology, 2014)
    In this thesis, we develop methods to address airlift scheduling, and in particular the problem of scheduling military aircraft capacity to meet ad hoc demand. Network optimization methods typically applied to scheduling ...
  • Stratila, Dan (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 ...
  • Gupta, Swati, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2017)
    Motivated by bottlenecks in algorithms across online and convex optimization, we consider three fundamental questions over combinatorial polytopes. First, we study the minimization of separable strictly convex functions ...
  • Kluberg, Lionel J. (Lionel Jonathan) (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 ...
  • Sood, Anshul, 1978- (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 ...
  • Barth, Christopher D. (Christopher Daniel), 1976- (Massachusetts Institute of Technology, 2001)
    In this thesis, we create a comprehensive model and efficient solution technique for generating air operations plans. Previous air operations models have fallen short in at least one of the following areas: routing. real-time ...
  • Weber, Theophane (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 ...
  • Sun, Peng, 1974- (Massachusetts Institute of Technology, 2003)
    The catalog industry is a large and important industry in the US economy. One of the most important and challenging business decisions in the industry is to decide who should receive catalogs, due to the significant mailing ...
MIT-Mirage