A customized branch-and-bound approach for irregular shape nesting.
Akang WangChristopher L. HanselmanChrysanthos E. GounarisPublished in: J. Glob. Optim. (2018)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- arbitrarily shaped
- upper bound
- combinatorial optimization
- column generation
- search space
- optimal solution
- branch and bound procedure
- beam search
- randomly generated problems
- branch and bound method
- network design problem
- branch and bound search
- tree search
- lagrangian heuristic
- integer programming problems
- depth first search
- max sat
- search strategies
- linear programming
- linear programming relaxation
- tree decomposition
- partial solutions
- search strategy
- mini bucket
- multi objective