Browsing Operations Research Center by Title
Now showing items 350-369 of 372
-
Tailoring Benders Decomposition for Uncapacitated Network Design
(Massachusetts Institute of Technology, Operations Research Center, 1984) -
A technique for speeding up the solution of the Lagrangean dual
(Massachusetts Institute of Technology, Operations Research Center, 1991) -
Theoretical Efficiency of A Shifted Barrier Function Algorithm for Linear Programming
(Massachusetts Institute of Technology, Operations Research Center, 1989-04)This paper examines the theoretical efficiency of solving a standard-form linear program by solving a sequence of shifted-barrier problems of the form minimize cTx - n (xj + ehj) j.,1 x s.t. Ax = b , x + e h > , for a given ... -
The theory of cyclic transfers
(Massachusetts Institute of Technology, Operations Research Center, 1989) -
Thoughts on Curriculum Development for Public Systems Analysis
(Massachusetts Institute of Technology, Operations Research Center, 1972-04) -
Toward a Framework for Process Evaluation
(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, ... -
Transient laws of non-stationary queueing systems and their applications
(Massachusetts Institute of Technology, Operations Research Center, 1995) -
Transitive Packing: A Unifying Concept in Combinatorial Optimization
(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 ... -
The Travelling Salesman Problem and Related Problems
(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 ... -
The Trouble with Diversity: Fork-Join Networks with Heterogenous Customer Population
(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 ... -
A two priority M/G/1 queue with feedback
(Massachusetts Institute of Technology, Operations Research Center, 1988) -
The Underlying Characteristics of the Bradford Distribution
(Massachusetts Institute of Technology, Operations Research Center, 1980-12)Not Available -
A unified method to analyze overtake free queueing systems
(Massachusetts Institute of Technology, Operations Research Center, 1992) -
A Unifying Geometric Solution Framework and Complexity Analysis for Variational Inequalities
(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 ... -
Use of distribution functions to describe the flow of scientific information
(Massachusetts Institute of Technology, Operations Research Center, 1979) -
Using EVAL for data analysis : a primer
(Massachusetts Institute of Technology, Operations Research Center, 1978) -
Using Partial Queue-Length Information to Improve the Queue Inference Engine's Performance
(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 ... -
Using the Monsanto software
(Massachusetts Institute of Technology, Operations Research Center, 1998) -
Valid Inequalities and Facets for the Steinger Problem in a Directed Graph
(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
(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 ...