Journal: Operations Research Letters

Found 1763 papers in total
An integer-programming-based heuristic for the balanced loading problem
An integer-programming-based heuristic for the balanced loading problem
1998,
This paper presents an efficient heuristic algorithm for the one-dimensional loading...
Introduction to ABACUS – a branch-and-cut system
Introduction to ABACUS – a branch-and-cut system
1998,
The software system ABACUS is an object-oriented framework for the implementation of...
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
1996,
We propose a method for finding the efficient set of a multiple objective linear...
On the long-step path-following method for semidefinite programming
On the long-step path-following method for semidefinite programming
1998,
It has been shown in various recent research reports that the analysis of short-step...
A necessary second-order optimality condition in nonsmooth mathematical programming
A necessary second-order optimality condition in nonsmooth mathematical programming
1996,
Generalized second-order directional derivatives for nonsmooth real-valued functions...
A solvable case of the quadratic assignment problem
A solvable case of the quadratic assignment problem
1998,
This short note investigates a restricted version of the quadratic assignment problem...
The monotonic diameter of traveling salesman polytopes
The monotonic diameter of traveling salesman polytopes
1998,
The monotonic diameter of the polytopes arising in the asymmetric and the symmetric...
Cliques and clustering: A combinatorial approach
Cliques and clustering: A combinatorial approach
1998,
We use column generation and a specialized branching technique for solving constrained...
Autoregressive to anything: Time-series input processes for simulation
Autoregressive to anything: Time-series input processes for simulation
1996,
We develop a model for representing stationary time series with arbitrary marginal...
Estimating stock levels in periodic review inventory systems
Estimating stock levels in periodic review inventory systems
1998,
Calculating the mean physical stock in a simple periodic review inventory system seems...
Heuristic solution of the multisource Weber problem as a p-median problem
Heuristic solution of the multisource Weber problem as a p-median problem
1998,
Good heuristic solutions for large multisource Weber problems can be obtained by...
Accelerating convergence in the Fermat–Weber location problem
Accelerating convergence in the Fermat–Weber location problem
1998,
This paper presents a simple procedure for accelerating convergence in a generalized...
Edge coloring nearly bipartite graphs
Edge coloring nearly bipartite graphs
1999,
We give a simple polynomial time algorithm to compute the chromatic index of graphs...
Arbitrary-norm separating plane
Arbitrary-norm separating plane
1999,
A plane separating two point sets in n -dimensional real space is constructed such...
Dual decomposition in stochastic integer programming
Dual decomposition in stochastic integer programming
1999,
We present an algorithm for solving stochastic integer programming problems with...
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
1999,
We investigate a special case of the bottleneck transportation problem where the...
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems
1999,
We consider the ordered cluster traveling salesman problem (OCTSP). In this problem, a...
A level-crossing approach to the solution of the shortest-queue problem
A level-crossing approach to the solution of the shortest-queue problem
1997,
We develop a two-dimensional extension of the standard level-crossing approach and...
Using different response-time requirements to smooth time-varying demand for service
Using different response-time requirements to smooth time-varying demand for service
1999,
Many service systems have demand that varies significantly by time of day, making it...
Monte Carlo bounding techniques for determining solution quality in stochastic programs
Monte Carlo bounding techniques for determining solution quality in stochastic programs
1999,
A stochastic program SP with solution value z * can be approximately solved by...
Bounds and approximations for cycle times of a U-shaped production line
Bounds and approximations for cycle times of a U-shaped production line
1997,
In this paper, we deal with a U-shaped production line with a single multi-function...
Error bounds on a practical approximation for finite tandem queues
Error bounds on a practical approximation for finite tandem queues
1997,
A simple practical approximation is studied for a two-stage tandem queue with a finite...
Scheduling on identical machines: How good is longest processing time in an on-line setting?
Scheduling on identical machines: How good is longest processing time in an on-line setting?
1997,
We consider a parallel machine scheduling problem where jobs arrive over time. A set...
Optimal scheduling on parallel machines for a new order class
Optimal scheduling on parallel machines for a new order class
1999,
This paper addresses the problem of scheduling n unit length tasks on m identical...
Papers per page: