Now showing items 226-228 of 372

    • Survivable Networks, Linear Programming Relaxations and the Parsimonious Property 

      Goemans, Michel X.; Bertsimas, Dimitris J. (Massachusetts Institute of Technology, Operations Research Center, 1990-06)
      We consider the survivable network design problem - the problem of designing, at minimum cost, a network with edge-connectivity requirements. As special cases, this problem encompasses the Steiner tree problem, the traveling ...
    • Performance Bounds for Scheduling Queueing Networks 

      Ou, Jihong; Wein, Lawrence M. (Massachusetts Institute of Technology, Operations Research Center, 1990-09)
      The goal of this paper is to assess the improvement in performance that might' be achieved by optimally scheduling a multiclass open queueing network. A stochastic process is defined whose steady-state mean value is less ...
    • A queuing theory, Bayesian model for the circulation of books in a library 

      Morse, Philip M., 1903-; Massachusetts Institute of Technology. Operations Research Center; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1977)