Journal: Operations Research Letters

Found 1763 papers in total
A branch and bound algorithm for the robust shortest path problem with interval data
A branch and bound algorithm for the robust shortest path problem with interval data
2004,
Many real problems can be modelled as robust shortest path problems on interval...
On Gilmore–Gomory's open question for the bottleneck TSP
On Gilmore–Gomory's open question for the bottleneck TSP
2003,
Consider the traveling salesman problem where the distance between two cities A and B...
On the nearest neighbor rule for the traveling salesman problem
On the nearest neighbor rule for the traveling salesman problem
2004,
Rosenkrantz et al . and Johnson and Papadimitriou constructed families of TSP...
A bilevel programming approach to the travelling salesman problem
A bilevel programming approach to the travelling salesman problem
2004,
We show that the travelling salesman problem is polynomially reducible to a bilevel...
Supplier diversification: effect of discrete demand
Supplier diversification: effect of discrete demand
1999,
Diversification under supply uncertainty has been adopted by manufacturers in order to...
Dynamic staffing in a telephone call center aiming to immediately answer calls
Dynamic staffing in a telephone call center aiming to immediately answer calls
1999,
This paper proposes practical modeling and analysis methods to facilitate dynamic...
Duality of dams via mountain processes
Duality of dams via mountain processes
2003,
We consider a G/M/ 1-type dam having finite capacity and a general release rule, and...
Optimal incentive-compatible pricing for M/G/1 queues
Optimal incentive-compatible pricing for M/G/1 queues
2003,
This paper extends the applicability of the pricing results of Mendelson and Whang,...
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
2004,
We compare the overall mean response time (a.k.a. sojourn time) of the processor...
The N threshold policy for the G/M/1 queue
The N threshold policy for the G/M/1 queue
2004,
We study a GI/M/ 1 queue with an N threshold policy. In this system, the server stops...
The analysis of a multiserver queue fed by a discrete autoregressive process of order 1
The analysis of a multiserver queue fed by a discrete autoregressive process of order 1
2004,
Based on matrix analytic methods and the theory of Markov regenerative processes, we...
Asymptotics of overflow probabilities in Jackson networks
Asymptotics of overflow probabilities in Jackson networks
2004,
We consider the probability that the total population of a Jackson network exceeds a...
Approximations for Markovian multi-class queues with preemptive priorities
Approximations for Markovian multi-class queues with preemptive priorities
2004,
We discuss the approximation of performance measures in multi-class M/M/k queues with...
A note on stability for parametric equilibrium problems
A note on stability for parametric equilibrium problems
2003,
In this paper we consider equilibrium problems in vector metric spaces where the...
A constrained independent set problem for matroids
A constrained independent set problem for matroids
2004,
In this note, we study a constrained independent set problem for matroids. The problem...
On the robustness of batching estimators
On the robustness of batching estimators
2004,
We propose and investigate an alternative definition of robustness for estimators of...
Managing individual customer service constraints under stochastic demand
Managing individual customer service constraints under stochastic demand
1999,
In recent years management of customer requirements has been the foremost concern of...
The value iteration method for countable state Markov decision processes
The value iteration method for countable state Markov decision processes
1999,
This paper deals with Markov decision processes with a countable state space. We...
Lifting theorems and facet characterization for a class of clique partitioning inequalities
Lifting theorems and facet characterization for a class of clique partitioning inequalities
1999,
In this paper we prove two lifting theorems for the clique partitioning polytope,...
Basic optimality results for Bayesian group replacement policies
Basic optimality results for Bayesian group replacement policies
2004,
The optimal structure of Bayesian group replacement policies for a parallel system of...
Manifolds of multi-leader Cournot equilibria
Manifolds of multi-leader Cournot equilibria
2004,
We show that the known uniqueness results for leader–follower Cournot games with...
The facets of the polytope of modules of a graph
The facets of the polytope of modules of a graph
2003,
After recalling the main facts of the well-studied modular decomposition theory for...
On the complexity of the robust spanning tree problem with interval data
On the complexity of the robust spanning tree problem with interval data
2004,
This paper studies the complexity of the robust spanning tree problem with interval...
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets
2004,
The maximum stable set problem is -->NP -->-hard. Koster and Zymolka introduced as a...
Papers per page: