A perfect information lower bound for robust lot-sizing problems.

Marcio Costa Santos Michael Poss Dritan Nace

Published in: Ann. Oper. Res. (2018)

Keyphrases

worst case
lower bound
lot sizing
upper bound
cutting stock
perfect information
multistage
mixed integer programming
single item
branch and bound algorithm
robust optimization
optimization problems
lead time
optimal solution
mixed integer
bin packing
imperfect information
rolling horizon
bayesian networks