A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs.
Alessandro AloisioClaudio ArbibFabrizio MarinelliPublished in: CTW (2008)
Keyphrases
- setup cost
- lp relaxation
- integer programming
- production planning
- integer program
- column generation
- linear programming
- lot sizing
- production cost
- linear program
- valid inequalities
- lead time
- np hard
- asymptotically optimal
- total cost
- message passing
- average cost
- knapsack problem
- mixed integer programming
- feasible solution
- network flow
- optimal solution
- long run
- global constraints
- energy minimization
- dynamic programming
- cutting plane
- constraint programming
- linear programming relaxation
- multistage
- lagrangian relaxation
- state dependent
- special case
- optimization problems