Browsing Operations Research Center Working Papers by Title
Now showing items 285-304 of 372
-
The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties
(Massachusetts Institute of Technology, Operations Research Center, 1988) -
The Probabilistic Minimum Spanning Tree, Part II: Probabilistic Analysis and Asymptotic Results
(Massachusetts Institute of Technology, Operations Research Center, 1988-08)In this paper, which is a sequel to [3], we perform probabilistic analysis under the random Euclidean and the random length models of the probabilistic minimum spanning tree (PMST) problem and the two re-optimization ... -
Problem Formulations and Numerical Analysis in Interger Programming and Combinatorial Optimization
(Massachusetts Institute of Technology, Operations Research Center, 1979-12) -
Product Selection Policies for Perishable Inventory Systems
(Massachusetts Institute of Technology, Operations Research Center, 1990-08)A comparison is made of the performance characteristics of perishable inventory systems with LIFO and FIFO selection policies. For each system one has Poisson arrivals to inventory and Poisson demand epochs with known rates ... -
Production Allocation Remodeling System: Optimizing for Competitive Advantage in a Mature Manufacturing Industry
(Massachusetts Institute of Technology, Operations Research Center, 1986-12)Not Available -
Progressive equilibration algorithms : the case of linear transaction costs
(Massachusetts Institute of Technology, Operations Research Center, 1989) -
Projective Pre-Conditioners for Improving the Behavior of a Homogeneous Conic Linear System
(Massachusetts Institute of Technology, Operations Research Center, 2005-05-31)In this paper we present a general theory for transforming a normalized homogeneous conic system F : Ax = 0, s'x = 1, x in C to an equivalent system via projective transformation induced by the choice of a point w in the ... -
Projective transformations for interior point methods, Part I: Basic Theory and Linear Programming
(Massachusetts Institute of Technology, Operations Research Center, 1988) -
Projective Transformations for Interior Point Methods, Part II: Analysis of An Algorithm for Finding the Weighted Center of a Polyhedral System
(Massachusetts Institute of Technology, Operations Research Center, 1988-06)In Part II of this study, the basic theory of Part I is applied to the problem of finding the w-center of a polyhedral system X . We present a projective transformation algorithm, analagous but more general than Karmarkar's ... -
Punishment policies' effect on illicit drug users' purchasing habits
(Massachusetts Institute of Technology, Operations Research Center, 1989) -
Pup Matching: Model Formulations and Solution Approaches
(Massachusetts Institute of Technology, Operations Research Center, 2003-02)We model Pup Matching, the logistics problem of matching or pairing semitrailers known as pups to cabs that are able to tow one or two of the pups simultaneously, as an AfP-complete version of the Network Loading Problem ... -
A queuing theory, Bayesian model for the circulation of books in a library
(Massachusetts Institute of Technology, Operations Research Center, 1977) -
A Rational Approach to Governmental Decision Concerning Air Pollution
(Massachusetts Institute of Technology, Operations Research Center, 1971-08)This paper addresses a problem common to many government agencies--trying to specify a regulatory policy that is in some sense best for a given situation. Such questions demand the consideration of multiple conflicting ... -
Reference guide to the framework presented in "Implementing reusable solvers : an objected-oriented framework for operations research algorithms"
(Massachusetts Institute of Technology, Operations Research Center, 1998) -
A response time estimator for police patrol dispatching
(Massachusetts Institute of Technology, Operations Research Center, 1984) -
Restless Bandits, Linear Programming Relaxations and a Primal-Dual Heuristic
(Massachusetts Institute of Technology, Operations Research Center, 1994-08)We propose a mathematical programming approach for the classical PSPACE - hard problem of n restless bandits in stochastic optimization. We introduce a series of n increasingly stronger linear programming relaxations, the ... -
Return on Investment Analysis for Facility Location
(Massachusetts Institute of Technology, Operations Research Center, 1991-05)We consider how the optimal decision can be made if the optimality criterion of maximizing profit changes to that of maximizing return on investment for the general uncapacitated facility location problem. We show that the ... -
Risk Independence and Multiattributed Utility Functions
(Massachusetts Institute of Technology, Operations Research Center, 1971-06)The concepts of conditional risk aversion, the conditional risk premium, and risk independence pertaining to multiattributed utility functions are defined. The latter notion is then generalized to what is called utility ... -
Routing and Scheduling on a Shoreline with Release Times
(Massachusetts Institute of Technology, Operations Research Center, 1986-09)In this paper we examine computational complexity issues and develop algorithms for a class of "shoreline" single-vehicle routing and scheduling problems with release time constraints. Problems in this class are interesting ... -
Routing in Point-to-Point Delivery Systems
(Massachusetts Institute of Technology, Operations Research Center, 1988-01)We develop an optimization-based approach for a point-to-point route planning problem that arises in many large scale delivery systems(for example, less-than-truckload freight, rail, mail and package delivery, communications). ...