Now showing items 64-66 of 372

    • Minimizing the number of vehicles to meet a fixed periodic schedule : an application of periodic posets 

      Orlin, James B., 1953-; Massachusetts Institute of Technology. Operations Research Center; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1980)
    • Restless Bandits, Linear Programming Relaxations and a Primal-Dual Heuristic 

      Bertsimas, Dimitris J.; Nino-Mora, Jose (Massachusetts Institute of Technology, Operations Research Center, 1994-08)
      We propose a mathematical programming approach for the classical PSPACE - hard problem of n restless bandits in stochastic optimization. We introduce a series of n increasingly stronger linear programming relaxations, the ...
    • Heuristics, LPs, and Generalizations of Trees on Trees 

      Balakrishnan, Anantaram; Magnanti, Thomas L.; Mirchandani, Prakash (Massachusetts Institute of Technology, Operations Research Center, 1993-01)
      We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some ...