Journal: Operations Research Letters

Found 1763 papers in total
Asymptotic optimality of the static frequency caching in the presence of correlated requests
Asymptotic optimality of the static frequency caching in the presence of correlated requests
2009,
It is well known that the static caching algorithm that keeps the most frequently...
Covering skew-supermodular functions by hypergraphs of minimum total size
Covering skew-supermodular functions by hypergraphs of minimum total size
2009,
The paper presents results related to a theorem of Szigeti on covering symmetric...
A short note on the weighted sub-partition mean of integers
A short note on the weighted sub-partition mean of integers
2009,
In this note we study weighted sub-partitions ( i 1 ,…, i j ) of positive...
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
2009,
We consider the problem of scheduling n preemptive jobs on a single machine to...
Bias optimality for multichain continuous-time Markov decision processes
Bias optimality for multichain continuous-time Markov decision processes
2009,
This paper deals with the bias optimality of multichain models for finite...
Instability of FIFO in a simple queueing system with arbitrarily low loads
Instability of FIFO in a simple queueing system with arbitrarily low loads
2009,
We show, using a simple example, that the First-In-First-Out (FIFO) policy can be...
A powerful route minimization heuristic for the vehicle routing problem with time windows
A powerful route minimization heuristic for the vehicle routing problem with time windows
2009,
We suggest an efficient route minimization heuristic for the vehicle routing problem...
A superclass of Edge-Path-Tree graphs with few cliques
A superclass of Edge-Path-Tree graphs with few cliques
2009,
Edge-Path-Tree (EPT) graphs are intersection graphs of EPT matrices that is matrices...
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
2009,
We consider the bounded integer knapsack problem (BKP) max Σ j = 1 n p j x j ,...
The counting complexity of a simple scheduling problem
The counting complexity of a simple scheduling problem
2009,
Let T be a set of tasks. Each task has a non-negative processing time and a deadline....
Risk-sensitive dynamic pricing for a single perishable product
Risk-sensitive dynamic pricing for a single perishable product
2009,
We show that the monotone structures of dynamic pricing for a single perishable...
An inventory system with two suppliers and default risk
An inventory system with two suppliers and default risk
2009,
This paper considers the problem of joint replenishment and pricing for a single...
A note on the subadditive network design problem
A note on the subadditive network design problem
2009,
We study approximation algorithms for generalized network design where the cost of an...
An improved Benders decomposition applied to a multi-layer network design problem
An improved Benders decomposition applied to a multi-layer network design problem
2009,
Benders decomposition has been widely used for solving network design problems. In...
Uniform multicommodity flow through the complete graph with random edge-capacities
Uniform multicommodity flow through the complete graph with random edge-capacities
2009,
Give random capacities C to the edges of the complete n -vertex graph. Consider the...
On the convergence of stochastic dual dynamic programming and related methods
On the convergence of stochastic dual dynamic programming and related methods
2008,
We discuss the almost-sure convergence of a broad class of sampling algorithms for...
Finding a feasible flow in a strongly connected network
Finding a feasible flow in a strongly connected network
2008,
We give a linear-time algorithm to find a feasible flow in a strongly connected...
Batch sizing under learning and forgetting: Steady state characteristics for the constant demand case
Batch sizing under learning and forgetting: Steady state characteristics for the constant demand case
2008,
We analyze steady-state characteristics of batch production time for a constant-demand...
Weakly and properly nonessential objectives in multiobjective optimization problems
Weakly and properly nonessential objectives in multiobjective optimization problems
2008,
In this work we characterize objective functions which do not change the set of...
On the set of weakly efficient minimizers for convex multiobjective programming
On the set of weakly efficient minimizers for convex multiobjective programming
2008,
In this paper by employing an asymptotic approach we develop an existence and...
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
2008,
We consider the problem of on-line scheduling a set of n jobs on two parallel batch...
Composition of stable set polyhedra
Composition of stable set polyhedra
2008,
Barahona and Mahjoub found a defining system of the stable set polytope for a graph...
Kernel density in the study of the strong stability of the M/M/1 queueing system
Kernel density in the study of the strong stability of the M/M/1 queueing system
2008,
We use kernel density with correction of boundary effects to study the strong...
A robust approach to the chance-constrained knapsack problem
A robust approach to the chance-constrained knapsack problem
2008,
In this paper, the chance-constrained knapsack problem (CKP) is addressed. Relying on...
Papers per page: