Accelerating column generation for variable sized bin-packing problems.
Cláudio AlvesJosé M. Valério de CarvalhoPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- variable sized
- packing problem
- column generation
- integer programming
- bin packing
- linear programming
- vehicle routing
- set partitioning
- np hard
- lagrangean relaxation
- constraint programming
- integer program
- branch and bound
- integer linear programming
- mixed integer programming
- cutting plane
- cutting stock
- linear programming problems
- vehicle routing problem with time windows
- set covering
- dantzig wolfe decomposition
- production planning
- simplex method
- linear program
- exact solution
- linear programming relaxation
- set covering problem
- optimal solution
- valid inequalities
- network flow
- search algorithm