Advanced Search
DSpace@MIT

Browsing Operations Research Center Working Papers by Title

Research and Teaching Output of the MIT Community

Browsing Operations Research Center Working Papers by Title

Sort by: Order: Results:

  • Thompson, Paul Michael; Orlin, James B., 1953-; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1989)
  • Ferreira, Joseph Jr.; Keeney, Ralph L. (Massachusetts Institute of Technology, Operations Research Center, 1972-04)
  • Eckels, Timothy J. (Massachusetts Institute of Technology, Operations Research Center, 1979-12)
    A potentially powerful design for the evaluation of public programs is one which combines an assessment of program processes with an experimentally oriented analysis of program outcomes. Relatively little has been written, ...
  • Bertsimas, Dimitris J. (Massachusetts Institute of Technology, Operations Research Center, 1995)
  • Schulz, Andreas S.; Müller, Rudolf (Massachusetts Institute of Technology, Operations Research Center, 1999-10)
    This paper attempts to give a better understanding of the facial structure of previously separately investigated polyhedra. It introduces the notion of transitive packing and the transitive packing polytope. Polytopes that ...
  • Gavish, Bezalel; Graves, Stephen C. (Massachusetts Institute of Technology, Operations Research Center, 1978-07)
    New formulations are presented for the Travelling Salesman problem, and their relationship to previous formulations is investigated. The new formulations are extended to include a variety of transportation scheduling ...
  • Nguyen, Viên (Massachusetts Institute of Technology, Operations Research Center, 1992-10)
    Consider a feedforward network of single-server stations populated by multiple job types. Each job requires the completion of a number of tasks whose order of execution is determined by a set of deterministic precedence ...
  • Keilson, Julian; Servi, Les D.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1988)
  • Morse, Philip M., 1903- (Massachusetts Institute of Technology, Operations Research Center, 1980-12)
    Not Available
  • Bertsimas, Dimitris J.; Mourtzinou, Georgia (Massachusetts Institute of Technology, Operations Research Center, 1992)
  • Magnanti, Thomas L.; Perakis, Georgia (Massachusetts Institute of Technology, Operations Research Center, 1996-02)
    In this paper, we propose a concept of polynomiality for variational inequality problems and show how to find a near optimal solution of variational inequality problems in a polynomial number of iterations. To establish ...
  • Morse, Philip M., 1903- (Massachusetts Institute of Technology, Operations Research Center, 1979)
  • Wong, Thomas K.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1978)
  • 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 ...
  • Ruark, John Douglas, 1971-; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1998)
  • 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 ...
  • 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 ...
  • 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 ...
  • Ertekin, Seyda; Hirsh, Haym; Rudin, Cynthia (Massachusetts Institute of Technology, Operations Research Center, 2012-04-10)
  • 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 ...
MIT-Mirage