A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size.
Fabio FuriniEnrico MalagutiRosa Medina DuránAlfredo PersianiPaolo TothPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- column generation
- lagrangean relaxation
- mixed integer programming
- optimal solution
- integer linear programming
- lagrangian relaxation
- set covering problem
- linear programming
- set covering
- branch and bound
- integer programming
- linear programming relaxation
- integer program
- grasp with path relinking
- constraint programming
- linear program
- set partitioning
- vehicle routing
- hybrid meta heuristic
- knapsack problem
- dantzig wolfe
- exact solution
- linear programming problems
- vehicle routing problem with time windows
- cutting plane
- packing problem
- dynamic programming
- search algorithm
- complete search
- valid inequalities
- heuristic search
- small sized
- objective function
- branch and bound algorithm