| Article ID: | iaor20082324 |
| Country: | United Kingdom |
| Volume: | 34 |
| Issue: | 6 |
| Start Page Number: | 1721 |
| End Page Number: | 1743 |
| Publication Date: | Jun 2007 |
| Journal: | Computers and Operations Research |
| Authors: | Nemhauser George L., Savelsbergh Martin W.P., Hardin Jill R. |
| Keywords: | programming: linear |
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.