Guided dive for the spatial branch-and-bound.
Gérard DedieuMatthias KöppeQuentin LouveauxPublished in: J. Glob. Optim. (2017)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- branch and bound algorithm
- upper bound
- column generation
- optimal solution
- search space
- tree search
- combinatorial optimization
- branch and bound procedure
- branch and bound method
- randomly generated problems
- lagrangian heuristic
- tree search algorithm
- tree decomposition
- network design problem
- linear programming relaxation
- beam search
- max sat
- search strategies
- branch and bound search
- lagrangian relaxation
- linear programming
- depth first search
- multi objective
- integer programming problems
- mini bucket
- partial solutions
- bnb adopt