A branch and bound algorithm for the strip packing problem.
Ramón Alvarez-ValdésFrancisco ParreñoJosé Manuel TamaritPublished in: OR Spectr. (2009)
Keyphrases
- branch and bound algorithm
- branch and bound
- lower bound
- np hard
- approximation algorithms
- randomly generated
- upper bound
- optimal solution
- test problems
- lower bounding
- combinatorial optimization
- precedence constraints
- upper bounding
- randomly generated problems
- mixed integer linear programming
- single machine scheduling problem
- packing problem
- search tree
- fixed width
- variable ordering
- lagrangian relaxation
- finding an optimal solution
- max sat
- branch and bound method
- column generation
- constraint satisfaction problems
- maximum clique
- cost function