Now showing items 283-285 of 372

    • Markov Analysis of an Alternative to Pure Random Assignment 

      Bier, Vicki M. (Massachusetts Institute of Technology, Operations Research Center, 1979-07)
      There are many public policy settings in which random assignment of clients to experimental and control groups is not feasible. I will discuss one such case, and the alternative method of assignment which was actually used. ...
    • Efficient Computation of Probabilities of Events Described by Order Statistics and Application to a Problem of Queues 

      Jones, Lee K.; Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1991-05)
      Consider a set of N i.i.d. random variables in [0, 1]. When the experimental values of the random variables are arranged in ascending order from smallest to largest, one has the order statistics of the set of random ...
    • Worst-Case Analysis of Network Design Problem Heuristics 

      Wong, Richard T. (Massachusetts Institute of Technology, Operations Research Center, 1978-12)
      The Optimal Network problem (as defined by Scott [16]) consists of selecting a subset of arcs that minimizes the sum of the shortest paths between all nodes subject to a budget constraint. This paper considers the worst-case ...