A Hybrid Heuristic Based on Column Generation for Two- and Three- Stage Bin Packing Problems.
Filipe Pereira AlvelosElsa SilvaJosé Manuel Valério de CarvalhoPublished in: ICCSA (2) (2014)
Keyphrases
- column generation
- packing problem
- integer programming
- cutting stock
- linear programming
- set covering problem
- bin packing
- constraint programming
- integer program
- set partitioning
- branch and bound
- vehicle routing
- mixed integer programming
- integer linear programming
- linear program
- vehicle routing problem with time windows
- set covering
- lagrangean relaxation
- grasp with path relinking
- lagrangian relaxation
- exact solution
- cutting plane
- np hard
- optimal solution
- linear programming relaxation
- linear programming problems
- dantzig wolfe decomposition
- production planning
- lower bound
- search space
- genetic algorithm