Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.
Retsef LeviAndrea LodiMaxim SviridenkoPublished in: IPCO (2007)
Keyphrases
- multi item
- approximation algorithms
- combinatorial auctions
- cover inequalities
- lot sizing
- np hard
- setup times
- special case
- linear program
- minimum cost
- worst case
- multi period
- facility location problem
- convex hull
- learning algorithm
- precedence constraints
- setup cost
- objective function
- search space
- production cost
- primal dual
- continuous variables