Node selection strategies in interval Branch and Bound algorithms.
Bertrand NeveuGilles TrombettoniIgnacio ArayaPublished in: J. Glob. Optim. (2016)
Keyphrases
- selection strategies
- branch and bound algorithm
- branch and bound
- selection strategy
- lower bound
- search strategies
- randomly generated
- upper bound
- np hard
- set covering problem
- combinatorial optimization
- optimal solution
- haplotype inference
- search tree
- boolean satisfiability
- finding an optimal solution
- max sat
- variable ordering
- backtrack search
- search algorithm
- metaheuristic
- scheduling problem
- column generation
- feature space
- reinforcement learning