Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem.
Xiang SongJulia A. BennellPublished in: J. Oper. Res. Soc. (2014)
Keyphrases
- column generation
- mixed integer program
- lagrangean relaxation
- lagrangian relaxation
- integer program
- linear programming problems
- integer linear programming
- mixed integer programming
- optimal solution
- branch and bound
- set partitioning
- cutting plane
- exact solution
- linear programming
- set covering problem
- linear program
- simplex method
- linear relaxation
- set covering
- linear programming relaxation
- valid inequalities
- combinatorial optimization
- grasp with path relinking
- hybrid meta heuristic
- integer programming
- dantzig wolfe
- constraint programming
- vehicle routing
- search procedure
- feasible solution
- lp relaxation
- search algorithm
- dual variables
- search heuristics
- complete search
- beam search
- exact algorithms
- cutting plane algorithm
- dantzig wolfe decomposition
- vehicle routing problem with time windows
- objective function
- lower bound
- np hard
- timetabling problem
- network flow
- mixed integer
- lot sizing