Analysis of bounds for a capacitated single-item lot-sizing problem

13 years 4 months ago

Download www2.isye.gatech.edu

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 range of fast algorithms. Special attention is given to LP-based rounding algorithms.

Jill R. Hardin, George L. Nemhauser, Martin W. P.

Real-time Traffic

COR 2007 | Cornerstone Optimization Problems | Fast Algorithms | LP-based Rounding Algorithms |

claim paper

Related Content

» Lot sizing with inventory gains

» Algorithms for capacitated rectangle stabbing and lot sizing with joint setup costs

» Combinatorial Algorithms for the Unsplittable Flow Problem

» Improved Approximation Guarantees for LowerBounded Facility Location

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COR
Authors	Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh

Comments (0)

Sciweavers

Analysis of bounds for a capacitated single-item lot-sizing problem

COR 2007 | Cornerstone Optimization Problems | Fast Algorithms | LP-based Rounding Algorithms |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers