Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects.
Ignacio ArayaVíctor ReyesPublished in: J. Glob. Optim. (2016)
Keyphrases
- constraint satisfaction
- branch and bound algorithm
- backtrack search
- russian doll search
- combinatorial optimization
- constraint satisfaction problems
- combinatorial problems
- lower bound
- branch and bound
- constraint programming
- randomly generated
- constraint propagation
- heuristic search
- upper bound
- optimization problems
- search tree
- np hard
- search algorithm
- phase transition
- constraint solving
- set covering problem
- max sat
- optimal solution
- sat solvers
- variable ordering
- constraint relaxation
- arc consistency
- mathematical programming
- constraint problems
- haplotype inference
- genetic algorithm
- traveling salesman problem
- special case
- robust fault detection