Journal: Operations Research Letters

Found 1763 papers in total
An optimal algorithm for 2×n bottleneck transportation problems
An optimal algorithm for 2×n bottleneck transportation problems
1991,
Bottleneck transportation problems differ from the standard transportation problems...
A complete description of the traveling salesman polytope on 8 nodes
A complete description of the traveling salesman polytope on 8 nodes
1991,
The authors present three previously unknown classes of facets for the symmetric...
Average waiting time of a symmetric polling system under Bernoulli scheduling
Average waiting time of a symmetric polling system under Bernoulli scheduling
1991,
The authors consider a system of multiple queues served in cyclic order by a single...
Symmetry property of the throughput in closed tandem queueing networks with finite buffers
Symmetry property of the throughput in closed tandem queueing networks with finite buffers
1991,
In this paper the authors consider closed tandem queueing networks with finite buffers...
Negotiated price discounting of perishable inventories
Negotiated price discounting of perishable inventories
1991,
In this paper a model is presented for jointly optimizing the replenishment interval...
On the optimality of a static policy in a stochastic open shop
On the optimality of a static policy in a stochastic open shop
1991,
Consider n jobs and two machines. Each job has to be processed on both machines. The...
Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
1991,
The paper deals with the problem of scheduling jobs on a single machine, in which each...
SQVAM: A variance minimizing algorithm
SQVAM: A variance minimizing algorithm
1991,
The paper presents an algorithm for minimizing the variance of a nonlinear function of...
On pseudo-conversation laws for the cyclic server system with compound Poisson arrivals
On pseudo-conversation laws for the cyclic server system with compound Poisson arrivals
1991,
Boxma and Groenendijk obtain the pseudo-conservation laws for cyclic server systems,...
Estimating the asymptotic variance with batch means
Estimating the asymptotic variance with batch means
1991,
The authors show that there is no batch-means estimation procedure for consistently...
Analysis of initial transient deletion for replicated steady-state simulations
Analysis of initial transient deletion for replicated steady-state simulations
1991,
Consider the method of independent replications with initial transient deletion for...
Using a standard clock technique for efficient simulation
Using a standard clock technique for efficient simulation
1991,
An efficient simulation is introduced where sample paths of a finite number of...
Erratum to: Baseball playoff eliminations: An application of linear programming
Erratum to: Baseball playoff eliminations: An application of linear programming
1991,
In this erratum to IAOR 48382 the contribution of network programmers in the...
General economic equilibrium and variational inequalities
General economic equilibrium and variational inequalities
1991,
In this paper the authors apply the theory of variational inequalities to the general...
A theorem connecting utility function optimization and compromise programming
A theorem connecting utility function optimization and compromise programming
1991,
The aim of this paper is to determine conditions under which the Lagrangian maximum of...
A dual algorithm for submodular flow problems
A dual algorithm for submodular flow problems
1991,
A dual algorithm for the submodular flow problem is proposed. The concept of the...
Complete efficiency and the initialization of algorithms for multiple objective programming
Complete efficiency and the initialization of algorithms for multiple objective programming
1991,
Complete efficiency in multiple objective programming may be more common than has been...
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
1991,
A worst-case analysis of an algorithm proposed by Dannenbring for the m -machine...
Proof of a conjecture of Schrage about the completion time variance problem
Proof of a conjecture of Schrage about the completion time variance problem
1991,
The problem of minimizing the completion time variance of n jobs on a single machine...
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
1991,
The authors give a short proof that the network simplex algorithm with either the...
Convergence behavior of Karmarkar’s projective algorithm for solving a simple linear program
Convergence behavior of Karmarkar’s projective algorithm for solving a simple linear program
1991,
The authors describe the convergence behavior of Karmarkar’s projective...
Improved complexity bounds for location problems on the real line
Improved complexity bounds for location problems on the real line
1991,
In this note the authors apply recent results in dynamic programming to improve the...
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
1991,
The paper extends a result of Barahona, saying that T-join and perfect matching...
COSINE: A new graph coloring algorithm
COSINE: A new graph coloring algorithm
1991,
COSINE is a graph coloring algorithm which has been especially designed for producing...
Papers per page: