A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
Young-Gun GYoung-Jo SeongMaing-Kyu KangPublished in: Oper. Res. Lett. (2003)
Keyphrases
- branch and bound algorithm
- randomly generated problems
- test problems
- lower bound
- upper bound
- finding an optimal solution
- set covering problem
- randomly generated
- branch and bound
- combinatorial optimization
- mixed integer linear programming
- np hard
- optimal solution
- integer variables
- benchmark problems
- lower bounding
- branch and bound method