Browsing Operations Research Center Working Papers by Title
Now showing items 154-173 of 372
-
Jackson's rule for one-machine scheduling : making a good heuristic better
(Massachusetts Institute of Technology, Operations Research Center, 1989) -
Large scale geometric location problems (REVISED)
(Massachusetts Institute of Technology, Operations Research Center, 1985) -
Large scale geometric location problems.
(Massachusetts Institute of Technology, Operations Research Center, 1985) -
Lead Time Distribution of Three-Machine Two-Buffer Lines with Unreliable Machines and Finite Buffers
(Massachusetts Institute of Technology, Operations Research Center, 2016-08-23) -
A Learning Theory Framework for Sequential Event Prediction and Association Rules
(Massachusetts Institute of Technology, Operations Research Center, 2012-08-29) -
A Linear Approximation Approach to Duality in Nonlinear Programming
(Massachusetts Institute of Technology, Operations Research Center, 1973-04)Linear approximation and linear programming duality theory are used as unifying tools to develop saddlepoint, Fenchel and local duality theory. Among results presented is a new and elementary proof of the necessity and ... -
A linearization and decomposition algorithm for computing urban traffic equilibria
(Massachusetts Institute of Technology, Operations Research Center, 1983) -
Locating Discretionary Service Facilities II: Maximizing Market Size, Minimizing Inconvenience
(Massachusetts Institute of Technology, Operations Research Center, 1992-11)Discretionary service facilities are providers of products and/or services that are purchased by customers who are traveling on otherwise pre-planned trips such as the daily commute. Optimum location of such facilities ... -
Locating Mobile Servers on a Network with Markovian Processes
(Massachusetts Institute of Technology, Operations Research Center, 1978-10)The median problem has been generalized to the case in which facilities can be moved, at a cost, on the network in response to changes in the state of the network. Such changes are brought about by changes in travel times ... -
Location Games and Bounds for Median Problems
(Massachusetts Institute of Technology, Operations Research Center, 1985-01)We consider a two-person zero-sum game in which the maximizer selects a point in a given bounded planar region, the minimizer selects K points in that region,.and the payoff is the distance from the maximizer's location ... -
Location of facilities on a stochastic network
(Massachusetts Institute of Technology, Operations Research Center, 1974) -
Locations of Medians on Stochastic Networks
(Massachusetts Institute of Technology, Operations Research Center, 1977-10)The definition of network medians is extended to the case where travel times on network links are random variables with known discrete probability distributions. Under a particular set of assumptions, it is shown that the ... -
LOGS an optimization system for logistics planning
(Massachusetts Institute of Technology, Operations Research Center, 1979-10) -
The Long Term Effects of Merit Rating Plans on Individual Motorists
(Massachusetts Institute of Technology, Operations Research Center, 1972-04)Student interest in public sector problems has increased markedly in recent years. At M.I.T., this change has increased the demand for courses and programs of study that lead to the development of technologically advanced ... -
Lower bounds on the time to compute a simple boolean function on a parallel random access machine
(Massachusetts Institute of Technology, Operations Research Center, 1986) -
M/G/ oo with Batch Arrivals
(Massachusetts Institute of Technology, Operations Research Center, 1987-09)Let po(n) be the distribution of the number N(oo) in the system at ergodicity for systems with an infinite number of servers, batch arrivals with general batch size distribution and general holding times. This distribution ... -
Markov Analysis of an Alternative to Pure Random Assignment
(Massachusetts Institute of Technology, Operations Research Center, 1979-07)There are many public policy settings in which random assignment of clients to experimental and control groups is not feasible. I will discuss one such case, and the alternative method of assignment which was actually used. ... -
The Mathematical Analysis of Multilocation Distribution Systems: A Survey
(Massachusetts Institute of Technology, Operations Research Center, 1973-09)Not Available -
A mathematical programming approach to stochastic and dynamic optimization problems
(Massachusetts Institute of Technology, Operations Research Center, 1994) -
Mathematical programming models and methods for production planning and scheduling
(Massachusetts Institute of Technology, Operations Research Center, 1988)