Journal: Operations Research Letters

Found 1763 papers in total
A note on the maximization version of the multi-level facility location problem
A note on the maximization version of the multi-level facility location problem
2002,
We show that the maximization version of the multi-level facility location problem can...
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
2002,
We present an exact separation scheme for identifying most violated extended cover...
Solving the knapsack problem via ℤ-transform
Solving the knapsack problem via ℤ-transform
2002,
Given vectors a,c∈ℤ n and b ∈ℤ, we consider the (unbounded)...
A nonlinear Lagrangian dual for integer programming
A nonlinear Lagrangian dual for integer programming
2002,
Nonlinear Lagrangian theory offers a success guarantee for the dual search via...
An extension of the fundamental theorem of linear programming
An extension of the fundamental theorem of linear programming
2002,
In 1947 George Dantzig developed the Simplex Algorithm for linear programming, and in...
A least-squares primal–dual algorithm for solving linear programming problems
A least-squares primal–dual algorithm for solving linear programming problems
2002,
We have developed a least-squares primal–dual algorithm for solving linear...
An asymptotic simplex method for singularly perturbed linear programs
An asymptotic simplex method for singularly perturbed linear programs
2002,
We study singularly perturbed linear programs. These are linear programs whose...
On the equivalence of linear complementarity problems
On the equivalence of linear complementarity problems
2002,
We show that the Extended Linear Complementarity Problem (ELCP) can be recast as a...
An M/G/1 queue with Markov-dependent exceptional service times
An M/G/1 queue with Markov-dependent exceptional service times
2002,
This paper considers an M/G/ 1 queue in which service time distributions in each busy...
Mean first passage times in fluid queues
Mean first passage times in fluid queues
2002,
A stochastic fluid queueing system describes the input–output flow of a fluid in...
A push–pull queueing system
A push–pull queueing system
2002,
We consider a two node multiclass queueing network given by two machines each with two...
A matrix-geometric approximation for tandem queues with blocking and repeated attempts
A matrix-geometric approximation for tandem queues with blocking and repeated attempts
2002,
Our interest is in the study of the MAP/PH/1/1→·/PH/1/K+1 queue with...
A note on the optimality of the N- and D-policies for the M/G/1 queue
A note on the optimality of the N- and D-policies for the M/G/1 queue
2002,
This note considers the N- and D- policies for the M/G/1 queue. We concentrate on the...
A mountain process with state dependent input and output and a correlated dam
A mountain process with state dependent input and output and a correlated dam
2002,
We consider a single machine, subject to breakdown, that produces items to inventory....
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
2002,
We study a preemptive semi-online scheduling problem. Jobs with non-increasing sizes...
A linear time approximation scheme for makespan minimization in an open shop with release dates
A linear time approximation scheme for makespan minimization in an open shop with release dates
2002,
In this paper, we demonstrate the existence of a linear time approximation scheme for...
Semi-on-line problems on two identical machines with combined partial information
Semi-on-line problems on two identical machines with combined partial information
2002,
This paper considers the semi-on-line versions of scheduling problem P2‖C max ....
On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
2002,
We consider on-line scheduling of unit time jobs on a single machine with...
Large-sample normality of the batch-means variance estimator
Large-sample normality of the batch-means variance estimator
2002,
Consider a stationary stochastic process, X 1 ,X 2 ,..., arising from a steady-state...
An optimal replenishment policy for deteriorating items with time-varying demand and partial backlogging
An optimal replenishment policy for deteriorating items with time-varying demand and partial backlogging
2002,
Recently, Papachristos and Skouri developed an inventory model in which unsatisfied...
On a class of order pick strategies in paternosters
On a class of order pick strategies in paternosters
2002,
We study the travel time needed to pick n items in a paternoster, operating under the...
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....
TSP tour domination and Hamilton cycle decompositions of regular digraphs
TSP tour domination and Hamilton cycle decompositions of regular digraphs
2001,
In this paper, we solve a problem by Glover and Punnen from the context of domination...
Lyapunov method for the stability of fluid networks
Lyapunov method for the stability of fluid networks
2001,
One of the primary tools in establishing the stablity of a fluid network is to...
Papers per page: