Sciweavers

5 search results - page 1 / 1
» Analysis of bounds for a capacitated single-item lot-sizing ...
Sort
View
ORL
2007
49views more  ORL 2007»
13 years 4 months ago
Lot sizing with inventory gains
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one ...
Hamish Waterer
TALG
2008
152views more  TALG 2008»
13 years 4 months ago
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schiebe...
COR
2007
90views more  COR 2007»
13 years 4 months ago
Analysis of bounds for a capacitated single-item lot-sizing problem
Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a r...
Jill R. Hardin, George L. Nemhauser, Martin W. P. ...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 4 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
CORR
2011
Springer
192views Education» more  CORR 2011»
12 years 11 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy