Browsing Operations Research Center Working Papers by Title
Now showing items 59-78 of 372
-
Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant
(Massachusetts Institute of Technology, Operations Research Center, 1990-11)For a sample of points drawn uniformly from either the d-dimensional torus or the d-cube, d > 2, we define a class of random processes with the property of being asymptotically equivalent in expectation in the two models. ... -
A decomposition algorithm for local access telecommunications network expansion planning
(Massachusetts Institute of Technology, Operations Research Center, 1992) -
Decomposition Algorithms for Analyzing Transient Phenomena in Multi-class Queueing Networks in Air Transportation
(Massachusetts Institute of Technology, Operations Research Center, 1993-03)In a previous paper (Peterson, Bertsimas, and Odoni 1992), we studied the phenomenon of transient congestion in landings at a hub airport and developed a recursive approach for computing moments of queue lengths and waiting ... -
Decomposition Methods and the Computation of Spatial Equilibria: An Application to Coal Supply and Demand Models
(Massachusetts Institute of Technology, Operations Research Center, 1982-05)Not Available. -
Decomposition methods for facility location problems
(Massachusetts Institute of Technology, Operations Research Center, 1986) -
Decomposition methods for mathematical programming/economic equilibrium energy planning models
(Massachusetts Institute of Technology, Operations Research Center, 1977) -
Deducing Queue Statistics from Transactional Data
(Massachusetts Institute of Technology, Operations Research Center, 1987-08)The transactional data of a queueing system are the recorded times of service commencement and service completion for each customer served. With increasing use of computers to aid or even perform service one often has ... -
Deducing Queueing From Transactional Data: The Queue Inference Engine, Revisited
(Massachusetts Institute of Technology, Operations Research Center, 1990-04)Larson [1] proposed a method to statistically infer the expected transient queue length during a busy period in 0(n 5 ) solely from the n starting and stopping times of each customer's service during the busy period and ... -
Demand for library materials : an exercise in probability analysis
(Massachusetts Institute of Technology, Operations Research Center, 1976) -
The departure process from a GI/G/1 queue and its applications to the analysis of tandem queues
(Massachusetts Institute of Technology, Operations Research Center, 1990) -
The derivation of efficient sets
(Massachusetts Institute of Technology, Operations Research Center, 1977) -
The design of time-series comparisons under resource constraints
(Massachusetts Institute of Technology, Operations Research Center, 1981) -
Designing Equitable Merit Rating Plans
(Massachusetts Institute of Technology, Operations Research Center, 1976-08)Throughout the United States it is common practice for automobile insurance premiums for a particular policy to vary depending upon the driver class and geographic location of the policyholder as well as the type and number ... -
Designing Hierarchical Survivable Networks
(Massachusetts Institute of Technology, Operations Research Center, 1994-01)As the computer, communication, and entertainment industries begin to integrate phone, cable, and video services and to invest in new technologies such as fiber optic cables, interruptions in service can cause considerable ... -
Designing Satellite Communication Networks by Zero-One Quadratic Programming
(Massachusetts Institute of Technology, Operations Research Center, 1987-01)In satellite communications networks, distinctive facilities called homing stations perform special transmission functions. Local demand nodes clustered around each homing station communicate with each other via a local ... -
Deterministic network optimization : a bibliography
(Massachusetts Institute of Technology, Operations Research Center, 1976) -
Developing an Optimal Repair-Replacement Strategy for Pallets
(Massachusetts Institute of Technology, Operations Research Center, 1976-02)The problem of determining when to repair and when to replace failing equipment is a concern of management of productive resources. Inefficient management due to the use of non-optimal repair-replacement policies can have ... -
A distributed Poisson approximation for preempt-resume clocked schedules
(Massachusetts Institute of Technology, Operations Research Center, 1987) -
A distributional form of Little's Law
(Massachusetts Institute of Technology, Operations Research Center, 1987) -
The distributional form of Little's Law and the Fuhrmann-Cooper decomposition
(Massachusetts Institute of Technology, Operations Research Center, 1988)