Journal: Operations Research Letters

Found 1763 papers in total
Minimizing flow-time on a single machine with integer batch sizes
Minimizing flow-time on a single machine with integer batch sizes
2005,
We address a classical minimum flow-time, single-machine, batch-scheduling problem....
Exact solution of a class of nonlinear knapsack problems
Exact solution of a class of nonlinear knapsack problems
2005,
We consider a class of nonlinear knapsack problems with applications in service...
Approximation algorithms for the Euclidean bipartite traveling salesman problem
Approximation algorithms for the Euclidean bipartite traveling salesman problem
2005,
We study approximation results for the Euclidean bipartite traveling salesman problem...
Two fluid approximations for multi-server queues with abandonments
Two fluid approximations for multi-server queues with abandonments
2005,
Insight is provided into a previously developed M/M/s/r+M(n) approximation for...
Response time in a tandem queue with blocking, Markovian arrivals and phase-type services
Response time in a tandem queue with blocking, Markovian arrivals and phase-type services
2005,
A novel approach for obtaining the response time in a discrete-time tandem-queue with...
Continuous feedback fluid queues
Continuous feedback fluid queues
2005,
We investigate a fluid queue with feedback from the (finite) buffer to the background...
Synchronized queues with deterministic arrivals
Synchronized queues with deterministic arrivals
2005,
We consider m independent exponential servers in parallel, driven by the same...
Solving nonstationary infinite horizon stochastic production planning problems
Solving nonstationary infinite horizon stochastic production planning problems
2000,
Forecast horizons are defined as long enough planning horizons that ensure agreement...
A comparison of methods for lot-sizing in a rolling horizon environment
A comparison of methods for lot-sizing in a rolling horizon environment
2005,
We argue that the superior performance of a recent method for lot-sizing in a rolling...
A new index of component importance
A new index of component importance
2001,
Several indices of component importance have been proposed in the literature. The...
Monge strikes again: optimal placement of web proxies in the internet
Monge strikes again: optimal placement of web proxies in the internet
2000,
In a recent paper, Li et al . study the problem of placing m web proxies in the...
A note on expected rent in auction theory
A note on expected rent in auction theory
2005,
The expected rent in a reverse (buyer's) auction is shown to be monotonically...
A branch-and-cut algorithm for the maximum cardinality stable set problem
A branch-and-cut algorithm for the maximum cardinality stable set problem
2001,
We propose a branch-and-cut algorithm for the Maximum Cardinality Stable Set problem....
Improved algorithms for replacement paths problems in restricted graphs
Improved algorithms for replacement paths problems in restricted graphs
2005,
We present near-optimal algorithms for two problems related to finding the replacement...
An improved upper bound for the traveling salesman problem in cubic 3-edge-connected graphs
An improved upper bound for the traveling salesman problem in cubic 3-edge-connected graphs
2005,
We consider the traveling salesman problem (TSP) on (the metric completion of)...
On Padberg's conjecture about almost totally unimodular matrices
On Padberg's conjecture about almost totally unimodular matrices
2000,
We consider Padberg's conjecture about almost totally unimodular matrices proposed in...
Minmax regret solutions for minimax optimization problems with uncertainty
Minmax regret solutions for minimax optimization problems with uncertainty
2000,
We propose a general approach for finding minmax regret solutions for a class of...
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
2005,
In this paper, a linear-time algorithm is developed for the minmax-regret version of...
Compounded genetic algorithms for the quadratic assignment problem
Compounded genetic algorithms for the quadratic assignment problem
2005,
We introduce the compounded genetic algorithm. We propose to run a quick genetic...
Projected dynamical systems in a complementarity formalism
Projected dynamical systems in a complementarity formalism
2000,
Projected dynamical systems have been introduced by Dupuis and Nagurney as dynamic...
Maximum density stable patterns in variants of Conway's game of Life
Maximum density stable patterns in variants of Conway's game of Life
2000,
We use integer programming to find maximum density stable patterns in variants of...
An algorithm for the multiparametric 0–1-integer linear programming problem relative to the constraint matrix
An algorithm for the multiparametric 0–1-integer linear programming problem relative to the constraint matrix
2000,
The multiparametric 0–1-Integer Linear Programming (0–1-ILP) problem...
On improved Choi–Goldfarb solution-containing ellipsoids in linear programming
On improved Choi–Goldfarb solution-containing ellipsoids in linear programming
2000,
Ellipsoids that contain all optimal primal solutions, those that contain all optimal...
A parallel primal–dual simplex algorithm
A parallel primal–dual simplex algorithm
2000,
Recently, the primal–dual simplex method has been used to solve linear programs...
Papers per page: