Journal: Operations Research Letters

Found 1763 papers in total
Locating minimal sets using polyhedral cones
2011,
The first method to locate efficient points of a nonempty set introduced by Yu (1974)...
A bandwidth reduction algorithm for L‐shaped and Z‐shaped grid structured graphs
2011,
In this study, we have proposed an effective bandwidth reduction algorithm. This...
Breaks, cuts, and patterns
2011,
The concept of a break is generalized by considering pairs of arbitrary rounds....
On the demand pooling anomaly in inventory theory
2011,
The demand pooling anomaly of inventory theory of type F amounts to a kind of...
Computing the Grothendieck constant of some graph classes
2011,
The Grothendieck constant κ ( G ) of a graph G = ( [ n ] , E ) is the...
Integer‐empty polytopes in the 0/1‐cube with maximal Gomory–Chvátal rank
2011,
We provide a complete characterization of all polytopes P ⊆ [ 0 , 1 ] n with...
A note on equilibria for two‐tier supply chains with a single manufacturer and multiple retailers
2011,
A well‐studied problem in the supply chain management literature considers a...
A goodwill model with predatory advertising
2011,
We investigate the dynamic advertising policies of two competing firms in a...
Maximizing non‐monotone submodular set functions subject to different constraints: Combined algorithms
2011,
We study the problem of maximizing constrained non‐monotone submodular...
On the efficiency of price competition
2011,
We study the efficiency of price competition among multi‐product firms in...
Queue lengths and workloads in polling systems
2011,
For a single‐server multi‐station polling system, we focus on the...
An alternative proof of the Kawaguchi–Kyan bound for the Largest‐Ratio‐First rule
2011,
Kawaguchi and Kyan proved a worst case ratio for Largest‐Ratio‐First...
Aspects of a multivariate complexity analysis for Rectangle Tiling
2011,
We identify very restricted cases of Rectangle Tiling that remain NP‐hard....
Resource constraint scheduling with a fractional shared resource
2011,
We present a scheduling problem with a single shared resource. We compare ILP and...
A 3/2‐approximation algorithm for ki‐partitioning
2011,
We consider multiprocessor scheduling with the objective of minimizing the makespan....
A full‐Newton step interior‐point algorithm based on modified Newton direction
2011,
The central path plays a very important role in interior‐point methods. By an...
An approximation algorithm for the k‐Level Concentrator Location Problem
2011,
We analyze the k >‐Level Concentrator Location Problem. An approximation...
Optimal dynamic pricing and inventory control with stock deterioration and partial backordering
2011,
This paper studies dynamic pricing strategies for a periodic‐review inventory...
On mixed‐integer sets with two integer variables
2011,
We study polyhedral mixed‐integer sets with two integer variables. We show that...
Competition and contracting in service industries
2011,
In service industries, firms can offer different contractual agreements. Firms can...
Branch‐and‐cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
2011,
We propose a branch‐and‐cut approach over a formulation with only the...
Two‐stage minimax regret robust uncapacitated lot‐sizing problems with demand uncertainty
2011,
We consider two‐stage minimax robust uncapacitated lot‐sizing problem. A...
Markov decision processes with state‐dependent discount factors and unbounded rewards/costs
2011,
This paper studies Markov decision processes with state‐dependent discount...
A hybrid Outer‐Approximation/Benders Decomposition algorithm for the single allocation hub location problem under congestion
2011,
Hub‐and‐spoke systems with single assignment are specially vulnerable to...
Papers per page: