Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities.
Retsef LeviAndrea LodiMaxim SviridenkoPublished in: Math. Oper. Res. (2008)
Keyphrases
- approximation algorithms
- multi item
- lot sizing
- inventory systems
- np hard
- multistage
- setup times
- special case
- single item
- combinatorial auctions
- worst case
- multi period
- mixed integer
- production planning
- minimum cost
- lead time
- facility location problem
- setup cost
- mixed integer programming
- planning horizon
- primal dual
- facility location
- lot size
- fixed cost
- random variables
- scheduling problem