Column generation for the variable cost and size bin packing problem with fragmentation.
Marco CasazzaAlberto CeselliPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- column generation
- linear programming
- branch and bound
- linear program
- integer linear programming
- mixed integer programming
- lagrangean relaxation
- integer programming
- lower bound
- variable sized
- exact solution
- optimal solution
- constraint programming
- integer program
- set partitioning
- lagrangian relaxation
- vehicle routing
- linear programming problems
- cutting plane
- vehicle routing problem with time windows
- set covering
- minimum cost
- linear programming relaxation
- branch and bound algorithm
- cutting plane algorithm
- valid inequalities
- multistage
- linear relaxation
- objective function