Login / Signup
Improved Randomized Approximation Algorithms for Lot-Sizing Problems.
Chung-Piaw Teo
Dimitris Bertsimas
Published in:
IPCO (1996)
Keyphrases
</>
approximation algorithms
lot sizing
randomized algorithms
vertex cover
cutting stock
mixed integer programming
np hard
special case
rolling horizon
multistage
multi item
production planning
bin packing
lead time
worst case
precedence constraints
decision making
single item
graphical models
optimal solution