Exact solution of bin-packing problems using column generation and branch-and-bound.
José M. Valério de CarvalhoPublished in: Ann. Oper. Res. (1999)
Keyphrases
- column generation
- branch and bound
- exact solution
- packing problem
- cutting stock
- lower bound
- search algorithm
- branch and bound algorithm
- search space
- bin packing
- optimal solution
- upper bound
- integer programming
- integer linear programming
- combinatorial optimization
- approximate solutions
- set partitioning
- mixed integer programming
- set covering problem
- cutting plane
- integer program
- lot sizing
- exact algorithms
- lagrangian relaxation
- vehicle routing problem with time windows
- tree search
- linear programming problems
- set covering
- search strategies
- linear programming relaxation
- linear programming
- dual variables