A New Linear Programming Approach to the Cutting Stock Problem.
Harald DyckhoffPublished in: Oper. Res. (1981)
Keyphrases
- linear programming
- column generation
- integer programming
- linear programming relaxation
- linear program
- feasible solution
- lagrangian relaxation
- np hard
- integer program
- dynamic programming
- linear programming problems
- nonlinear programming
- network flow
- primal dual
- optimal solution
- objective function
- small sized
- cutting plane
- mixed integer programming
- valid inequalities
- artificial intelligence
- simplex algorithm
- dual variables
- machine learning
- cutting stock problems
- constraint propagation
- expert systems
- data structure
- information retrieval