A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem.
Yaodong CuiYuli YangXian ChengPeihua SongPublished in: Comput. Oper. Res. (2008)
Keyphrases
- branch and bound algorithm
- packing problem
- fixed width
- lower bound
- branch and bound
- randomly generated
- upper bound
- np hard
- test problems
- lower bounding
- optimal solution
- combinatorial optimization
- randomly generated problems
- search tree
- knapsack problem
- single machine scheduling problem
- upper bounding
- mixed integer linear programming
- precedence constraints
- approximation algorithms
- lagrangian relaxation
- variable ordering
- integer programming
- finding an optimal solution
- max sat
- branch and bound method
- objective function
- linear program
- integer variables