Browsing Operations Research Center by Title
Now showing items 125-144 of 372
-
The general distributional Little's law and its applications
(Massachusetts Institute of Technology, Operations Research Center, 1991) -
The General N-Location Distribution Problem
(Massachusetts Institute of Technology, Operations Research Center, 1973-09)This paper studies the one-period, general network distribution problem with linear costs. The approach is to decompose the problem into a transportation problem that represents a stocking decision, and decoupled newsboy ... -
The Generalized Combination Method for Area Traffic Control
(Massachusetts Institute of Technology, Operations Research Center, 1973-08)A procedure is described for determining optimal signal settings in a network including cycle time, splits of green time and ffsets. A number of cycle times are scanned in the process. For each cycle, splits are determined ... -
Generalized Descent Methods for Asymmetric Systems of Equations and Variational Inequalities
(Massachusetts Institute of Technology, Operations Research Center, 1985-08)We consider generalizations of the steepest descent algorithm for solving asymmetric systems of equations. We first show that if the system is linear and is defined by a matrix M, then the method converges if M2 is positive ... -
Generalized Linear Programming Solves the Dual
(Massachusetts Institute of Technology, Operations Research Center, 1973-09)The generalized linear programming algorithm allows an arbitrary mathematical programming minimization problem to be analyzed as a sequence of linear programming approximations. Under fairly general assumptions, it is ... -
Generalized Linear Programming without Constraint Qualification
(Massachusetts Institute of Technology, Operations Research Center, 1982-06)Not Available -
A Geometric Analysis of Renegar’s Condition Number, and its interplay with Conic Curvature
(Massachusetts Institute of Technology, Operations Research Center, 2009-02-03) -
The Geometric and the Bradford Distributions: A Comparison
(Massachusetts Institute of Technology, Operations Research Center, 1976-02)Both the geometric and the Bradford probability distributions are used to describe collections of items of interest in information science. Each unit item has a productivity, an integer n measuring the amount of use of the ... -
Growing a list
(Massachusetts Institute of Technology, Operations Research Center, 2012-08-21) -
Heuristics, LPs, and Generalizations of Trees on Trees
(Massachusetts Institute of Technology, Operations Research Center, 1993-01)We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some ... -
Heuristics, LPs, and Trees on Trees: Network Design Analyses
(Massachusetts Institute of Technology, Operations Research Center, 1994-01)We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some ... -
A Hybrid Approach to Discrete Mathematical Programming
(Massachusetts Institute of Technology, Operations Research Center, 1976-03)The dynamic programming and branch-and-bound approaches are combined to produce a hybrid algorithm for separable discrete mathematical programs. The hybrid algorithm uses linear programming in a novel way to compute bounds ... -
Hypercube model with multiple-unit dispatches and police patrol-initiated activities
(Massachusetts Institute of Technology, Operations Research Center, 1988) -
The Impact of Processing Time Knowledge on Dynamic Job-Shop Scheduling
(Massachusetts Institute of Technology, Operations Research Center, 1989-11)The goal of this paper is to determine if the results for dynamic job-shop scheduling problems are affected by the assumptions made with regard to the processing time distributions and the scheduler's knowledge of the ... -
Implementing primal-dual network flow algorithms
(Massachusetts Institute of Technology, Operations Research Center, 1976) -
Implications of the Exact Bradford Distribution
(Massachusetts Institute of Technology, Operations Research Center, 1980) -
Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems
(Massachusetts Institute of Technology, Operations Research Center, 1988) -
Improved time bounds for the maximum flow problem
(Massachusetts Institute of Technology, Operations Research Center, 1988) -
Inferring balking behavior and queue performance from transactional data
(Massachusetts Institute of Technology, Operations Research Center, 1995)