Browsing Operations Research Center by Title
Now showing items 202-221 of 372
-
An N Server Cutoff Multi-Priority Queue
(Massachusetts Institute of Technology, Operations Research Center, 1985-02)Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. Service times are negative exponential. In order to save available servers for higher priority customers, arriving customers of each lower ... -
An N Server Cutoff Priority Queue Where Customers Request a Random Number of Servers
(Massachusetts Institute of Technology, Operations Research Center, 1985-05)Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. The number of servers requested by an arrival has a known probability distribution. Service times are negative exponential. In order to ... -
A nested decomposition method for vehicle routing and scheduling
(Massachusetts Institute of Technology, Operations Research Center, 1987) -
Network Flow Models for Designing Diameter-Constrained Minimum Spanning and Steiner Trees
(Massachusetts Institute of Technology, Operations Research Center, 2001-08)The Diameter-Constrained Minimum Spanning Tree Problem seeks a least cost spanning tree subject to a (diameter) bound imposed on the number of edges in the tree between any node pair. A traditional multicommodity flow model ... -
Network Flows
(Massachusetts Institute of Technology, Operations Research Center, 1988-08)Not Available -
Networks as an aid in transportation and contingency planning
(Massachusetts Institute of Technology, Operations Research Center, 1983) -
Networks of Non-homogeneous M/G/oo Systems
(Massachusetts Institute of Technology, Operations Research Center, 1990-01)For a network of G/oo service facilities, the transient joint distribution of the facility populations is found to have a simple Poisson product form with simple explicit formula for the means. In the network it is assumed ... -
A new algebraic geometry algorithm for integer programming
(Massachusetts Institute of Technology, Operations Research Center, 1998) -
New Analysis and Results for the Conditional Gradient Method
(Massachusetts Institute of Technology, Operations Research Center, 2013-07-10) -
A New M. I.T. Graduate Course: Analysis of Urban Service Systems
(Massachusetts Institute of Technology, Operations Research Center, 1971-06)Abstract not available -
New scaling algorithms for the assignment for minimum cycle mean problems
(Massachusetts Institute of Technology, Operations Research Center, 1988) -
Newton's method for the general parametric center problem with applications
(Massachusetts Institute of Technology, Operations Research Center, 1991) -
Nondifferentiable Optimization and Large Scale Linear Programming
(Massachusetts Institute of Technology, Operations Research Center, 1978-11)Not Available -
Nonlinear Formations and Improved Randomized Approximation Algorithms for Multiway and Multicut Problems
(Massachusetts Institute of Technology, Operations Research Center, 1995-06)We introduce nonlinear formulations of the multiway cut and multicut problems. By simple linearizations of these formulations we derive several well known formulations and valid inequalities as well as several new ones. ... -
Nonlinear programming and the maximum principle for discrete time optimal control problems
(Massachusetts Institute of Technology, Operations Research Center, 1973) -
A Note on Node Aggregation and Benders Decomposition
(Massachusetts Institute of Technology, Operations Research Center, 1982-09)Not Available -
A Note on Scheduling Problems with Irregular Starting Time Costs
(Massachusetts Institute of Technology, Operations Research Center, 2000-02)In [9], Maniezzo and Mingozzi study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure, ... -
A Note on the Number of Leaves of a Euclidean Minimal Spanning Tree
(Massachusetts Institute of Technology, Operations Research Center, 1990-11)We show that the number of vertices of degree k in the Euclidean minimal spanning tree through points drawn uniformly from either the d-dimensional torus or from the d-cube, d > 2, are asymptotically equivalent with ... -
A Note on the Primal-Dual and Out-of-Kilter Algorithms for Network Optimization Problems
(Massachusetts Institute of Technology, Operations Research Center, 1975-03)Not Available -
On an Extension of Condition Number Theory to Non-Conic Convex Optimization
(Massachusetts Institute of Technology, Operations Research Center, 2003-02)The purpose of this paper is to extend, as much as possible, the modern theory of condition numbers for conic convex optimization: z* := minz ctx s.t. Ax - b Cy C Cx , to the more general non-conic format: z* := minx ctx ...