Tighter relaxations for the cutting stock problem.
Christoph NitscheGuntram ScheithauerJohannes TernoPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- linear programming relaxation
- lower bound
- knapsack problem
- linear programming
- column generation
- integer programming
- branch and bound
- mixed integer programming
- integer program
- feasible solution
- upper bound
- cutting plane
- lower and upper bounds
- search space
- valid inequalities
- dynamic programming
- video sequences
- machine learning
- combinatorial optimization
- bayesian networks