Operations Research Center Working Papers: Recent submissions

Now showing items 220-222 of 372

    • Valid Inequalities and Facets for the Steinger Problem in a Directed Graph 

      Myung, Young-soo (Massachusetts Institute of Technology, Operations Research Center, 1991-06)
      In this paper, we describe the facial structure of the steiner problem in a directed graph by formulating it as a set covering problem. We first characterize trivial facets and derive a necessary condition for nontrivial ...

    • Using Partial Queue-Length Information to Improve the Queue Inference Engine's Performance 

      Hall, Susan A.; Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1991-05)
      The Queue Inference Engine (QIE) uses queue departure time data over a single congestion period to infer queue statistics. With partial queue-length information, the queue statistics become more accurate and the computational ...

    • On the P-coverage Problem on the Real Line 

      Hoesel, Stan Van; Wagelmans, Albert (Massachusetts Institute of Technology, Operations Research Center, 1991-06)
      Abstract: In this paper we consider the p-coverage problem on the real line. We first give a detailed description of an algorithm to solve the coverage problem without the upper bound p on the number of open facilities. ...