A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem.
Lijun WeiQian HuAndrew LimQiang LiuPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- guillotine cutting
- branch and bound
- branch and bound procedure
- search algorithm
- optimal solution
- beam search
- combinatorial optimization
- tree search algorithm
- branch and bound method
- tree search
- branch and bound search
- branch and bound algorithm
- lower bound
- heuristic solution
- lagrangian heuristic
- column generation
- depth first search
- search strategies
- linear programming relaxation
- upper bound
- search space
- randomly generated problems
- partial solutions
- network design problem
- lower and upper bounds
- objective function
- lagrangian relaxation
- np hard
- simulated annealing
- heuristic search
- mathematical programming
- reduce the search space
- integer programming
- game tree search
- metaheuristic
- mini bucket
- packing problem