Browsing Operations Research Center by Title

Now showing items 368-372 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 ...

    • Valid Inequalities and Facets of the Capacitated Plant Location Problem 

      Leung, Janny M. Y.; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1986-05)
      Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming ...

    • What the Textbooks Say About the Design of Experience 

      Lamar, Bruce W. (Massachusetts Institute of Technology, Operations Research Center, 1978-03)
      This report reviews classical experimental designs including single and multiple factor analysis of variance, analysis of covariance, and Latin squares designs. Assumptions used in the models are presented, and tests for ...

    • Wisely Using a Budget for Crowdsourcing 

      Ertekin, Seyda; Hirsh, Haym; Rudin, Cynthia (Massachusetts Institute of Technology, Operations Research Center, 2012-04-10)

    • 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 ...