Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case.
Mahdi DoostmohammadiKerem AkartunaliPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- lot sizing
- mixed integer programming
- mixed integer program
- valid inequalities
- multi item
- cutting stock
- mixed integer
- multistage
- planning horizon
- linear programming relaxation
- setup cost
- network design problem
- single item
- column generation
- production planning
- feasible solution
- bin packing
- lower bound
- mathematical programming
- capacity expansion
- optimization problems
- linear programming
- integer programming
- lot size
- lp relaxation