Browsing Operations Research Center by Title
Now showing items 361-372 of 372
-
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 ... -
What the Textbooks Say About the Design of Experience
(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
(Massachusetts Institute of Technology, Operations Research Center, 2012-04-10) -
Worst-Case Analysis of Network Design Problem Heuristics
(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 ...