Journal: Operations Research Letters

Found 1763 papers in total
A note on scheduling to meet two min-sum objectives
A note on scheduling to meet two min-sum objectives
2007,
We consider a single machine scheduling problem with two min-sum objective functions:...
A profit-maximizing supply chain network design model with demand choice flexibility
A profit-maximizing supply chain network design model with demand choice flexibility
2006,
We present a profit-maximizing supply chain design model in which a company has...
Simplest optimal cutting patterns for equal rectangles
Simplest optimal cutting patterns for equal rectangles
2006,
This paper presents branch-and-bound algorithms that can guarantee the simplest...
Echelon-stock (R,nT) control in two-stage serial stochastic inventory systems
Echelon-stock (R,nT) control in two-stage serial stochastic inventory systems
2007,
For the two-stage ( R , nT ) policy, we present an algorithm to estimate expected...
Partial inverse assignment problems under l1 norm
Partial inverse assignment problems under l1 norm
2007,
In this paper, we consider the partial inverse assignment problem under l 1 norm...
Analysis on the forward market equilibrium model
Analysis on the forward market equilibrium model
2007,
We establish the existence results for the Allaz–Vila forward market equilibrium...
Source location with rigidity and tree packing requirements
Source location with rigidity and tree packing requirements
2006,
We consider the following two problems: (i) given a graph, find a minimum size...
Direct graph k-partitioning with a Kernighan–Lin like heuristic
Direct graph k-partitioning with a Kernighan–Lin like heuristic
2006,
We show that the Kernighan–Lin like linear time heuristic for bipartitioning...
Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture
Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture
2006,
We analyze Lipták and Tunçel's conjecture on minimal graphs with N...
The stable set problem and the thinness of a graph
The stable set problem and the thinness of a graph
2007,
We introduce a poly-time algorithm for the maximum weighted stable set problem, when a...
The robust minimum spanning tree problem: Compact and convex uncertainty
The robust minimum spanning tree problem: Compact and convex uncertainty
2007,
We consider the robust minimum spanning tree problem where edges costs are on a...
Optimality in Feller semi-Markov control processes
Optimality in Feller semi-Markov control processes
2006,
Semi-Markov control processes with Borel state space and Feller transition...
Design of trees in the hose model: The balanced case
Design of trees in the hose model: The balanced case
2006,
In the hose model we are given upper bounds b − u /b + u on the amount of...
Counting the number of renewals during a random interval in a discrete-time delayed renewal process
Counting the number of renewals during a random interval in a discrete-time delayed renewal process
2007,
In a discrete-time delayed renewal process, we study the distribution of the number of...
On the disjoint paths problem
On the disjoint paths problem
2007,
Using flow and matching algorithms to solve the problem of finding disjoint paths...
The capacitated arc routing problem with refill points
The capacitated arc routing problem with refill points
2007,
This article introduces the capacitated arc routing problem with refill points. The...
Computing a maxian point of a simple rectilinear polygon
Computing a maxian point of a simple rectilinear polygon
2007,
Let P be a simple rectilinear polygon with n vertices. There are k points in P . The...
A new mixed integer programming formulation for facility layout design using flexible bays
A new mixed integer programming formulation for facility layout design using flexible bays
2006,
This paper presents a mixed-integer programming formulation to find optimal solutions...
Competitive newsvendor problems with the same Nash and Stackelberg solutions
Competitive newsvendor problems with the same Nash and Stackelberg solutions
2007,
Consider two newsvendors: (i) they compete satisfying substitutable demands searching...
An optimization algorithm for a penalized knapsack problem
An optimization algorithm for a penalized knapsack problem
2006,
We study a variation of the knapsack problem in which each item has a profit, a weight...
A note on two-person zero-sum communicating stochastic games
A note on two-person zero-sum communicating stochastic games
2006,
For undiscounted two-person zero-sum communicating stochastic games with finite state...
The k-level facility location game
The k-level facility location game
2006,
We propose a cost-sharing scheme for the k -level facility location game that is...
Min–Max payoffs in a two-player location game
Min–Max payoffs in a two-player location game
2006,
We consider a two-player, sequential location game with arbitrarily distributed...
Reduction tests for the prize-collecting Steiner problem
Reduction tests for the prize-collecting Steiner problem
2006,
This article introduces a proper redifinition of the concept of bottleneck Steiner...
Papers per page: