Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Operations Research Letters
Found
1763 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Locating minimal sets using polyhedral cones
2011,
Hernndez Elvira
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,
Jones Tarcius Doss L
In this study, we have proposed an effective bandwidth reduction algorithm. This...
Breaks, cuts, and patterns
2011,
Spieksma Frits C R
The concept of a break is generalized by considering pairs of arbitrary rounds....
On the demand pooling anomaly in inventory theory
2011,
Stadje Wolfgang
The demand pooling anomaly of inventory theory of type F amounts to a kind of...
Computing the Grothendieck constant of some graph classes
2011,
Laurent M
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,
Schulz Andreas S
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,
Koulamas Christos
A well‐studied problem in the supply chain management literature considers a...
A goodwill model with predatory advertising
2011,
Viscolani Bruno
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,
Fadaei Salman
We study the problem of maximizing constrained non‐monotone submodular...
On the efficiency of price competition
2011,
Perakis Georgia
We study the efficiency of price competition among multi‐product firms in...
Queue lengths and workloads in polling systems
2011,
Kosinski K M
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,
Schwiegelshohn Uwe
Kawaguchi and Kyan proved a worst case ratio for Largest‐Ratio‐First...
Aspects of a multivariate complexity analysis for Rectangle Tiling
2011,
Niedermeier Rolf
We identify very restricted cases of Rectangle Tiling that remain NP‐hard....
Resource constraint scheduling with a fractional shared resource
2011,
Singh Gaurav
We present a scheduling problem with a single shared resource. We compare ILP and...
A 3/2‐approximation algorithm for ki‐partitioning
2011,
Kellerer Hans
We consider multiprocessor scheduling with the objective of minimizing the makespan....
A full‐Newton step interior‐point algorithm based on modified Newton direction
2011,
Zhang Lipu
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,
Drexl Moritz A
We analyze the k >‐Level Concentrator Location Problem. An approximation...
Optimal dynamic pricing and inventory control with stock deterioration and partial backordering
2011,
Pang Zhan
This paper studies dynamic pricing strategies for a periodic‐review inventory...
On mixed‐integer sets with two integer variables
2011,
Gnlk Oktay
We study polyhedral mixed‐integer sets with two integer variables. We show that...
Competition and contracting in service industries
2011,
Johari Ramesh
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,
Uchoa Eduardo
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,
Zhang Muhong
We consider two‐stage minimax robust uncapacitated lot‐sizing problem. A...
Markov decision processes with state‐dependent discount factors and unbounded rewards/costs
2011,
Guo Xianping
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,
de Camargo Ricardo Saraiva
Hub‐and‐spoke systems with single assignment are specially vulnerable to...
First Page
3
4
5
6
7
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers