Journal: Operations Research Letters

Found 1763 papers in total
Sequencing to minimize the maximum renewal cumulative cost
Sequencing to minimize the maximum renewal cumulative cost
1992,
This paper considers the problem of sequencing n independent tasks, each of which is...
A characterization of the uncapacitated network design polytope
A characterization of the uncapacitated network design polytope
1992,
The uncapacitated network design problem is considered. The authors show that the...
The exact LPT-bound for maximizing the minimum completion time
The exact LPT-bound for maximizing the minimum completion time
1992,
The authors consider the problem of assigning a set of jobs to a system of m identical...
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
1992,
Several recent polynomial algorithms for the minimum cost circulation problem have the...
Dynamic priority rules when polling with multiple parallel servers
Dynamic priority rules when polling with multiple parallel servers
1992,
In this paper the authors extend previous results (by Browne and Yechiali) on dynamic...
A simple proof of the planar rectilinear Steiner ratio
A simple proof of the planar rectilinear Steiner ratio
1992,
The rectilinear Steiner ratio is the worst-case ratio of the length of a rectilinear...
On the complexity of scheduling tasks with discrete starting times
On the complexity of scheduling tasks with discrete starting times
1992,
The paper considers the problem of scheduling tasks with a discrete set of possible...
On the computational complexity of reliability redundancy allocation in a series system
On the computational complexity of reliability redundancy allocation in a series system
1992,
Finding the optimal redundancy that maximizes the system reliability is one of the...
Efficient heuristics to minimize total flow time with release dates
Efficient heuristics to minimize total flow time with release dates
1992,
This paper addresses the one machine scheduling problem to minimize total flow time...
A total-value greedy heuristic for the integer knapsack problem
A total-value greedy heuristic for the integer knapsack problem
1992,
This paper examines a new greedy heuristic for the integer knapsack problem. The...
Local search and the local structure of NP-complete problems
Local search and the local structure of NP-complete problems
1992,
It is shown that certain NP-complete problems (traveling salesman, min-cut graph...
Uniformization for nonhomogeneous Markov chains
Uniformization for nonhomogeneous Markov chains
1992,
The discrete Poissonian representation for transition probabilities of homogeneous...
Numerical inversion of probability generating functions
Numerical inversion of probability generating functions
1992,
Random quantities of interest in operations research models can often be determined...
Solving linear bottleneck assignment problems via strong spanning trees
Solving linear bottleneck assignment problems via strong spanning trees
1992,
An efficient algorithm for solving the n×n linear bottleneck assignment problem...
On the minimax approximation in the class of the univariate piecewise constant functions
On the minimax approximation in the class of the univariate piecewise constant functions
1992,
The paper is concerned with the best approximation of a piecewise constant univariate...
A build-up variant of the logarithmic barrier method for LP
A build-up variant of the logarithmic barrier method for LP
1992,
The authors propose a strategy for building up the linear program while using a...
A diagonal quadratic approximation method for large scale linear programs
A diagonal quadratic approximation method for large scale linear programs
1992,
An augmented Lagrangian method is proposed for handling the common rows in large scale...
The generalized simplex method
The generalized simplex method
1992,
A method for solving lienar programs which corresponds to a generalization of the...
On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm
On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm
1992,
In this short note, the authors prove that the global convergence rate of the duality...
Lagrangean duality for facial programs with applications to integer and complementarity problems
Lagrangean duality for facial programs with applications to integer and complementarity problems
1992,
In this paper the authors consider how to close the duality gap when Lagrangean...
Sensitivity analysis in MCDM using the weight space
Sensitivity analysis in MCDM using the weight space
1992,
Sensitivity analysis of compromise solutions is a key issue in interactive multiple...
Faces with large diameter on the symmetric traveling salesman polytope
Faces with large diameter on the symmetric traveling salesman polytope
1992,
This paper deals with the symmetric traveling salesman polytope and contains three...
Traveling salesman problem under categorization
Traveling salesman problem under categorization
1992,
The paper introduces two new classes of traveling salesman problems (TSP1 and TSP2)...
Analysis of the Held-Karp lower bound for the asymmetric TSP
Analysis of the Held-Karp lower bound for the asymmetric TSP
1992,
The paper shows that the Held-Karp lower bound for the asymmetric traveling salesman...
Papers per page: