Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch-and-Cut

By Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh. 2000

56 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/824d95536890c8a3e014663afa9b0521d0c84115

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Lisbeth Buschkühl
2. Nadjib Brahimi
3. F. Sahling
4. S. Helber
5. H. Tempelmeier
6. Najib M. Najid
7. Atle Nordli
8. Stéphane Dauzère-Pérès

Citations in the corpus

• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (2010, methodology): “Millar and Yang (1994) LR SET TP, INT LCINT TP SO SL, BO”
• Single item lot sizing problems (2006, methodology): “[76] used valid inequalities (strong cutting planes); and Lozano et al.”