Dual bounding procedures lead to convergent Branch-and-Bound algorithms.
Mirjam DürPublished in: Math. Program. (2001)
Keyphrases
- branch and bound algorithm
- upper bound
- lower bound
- branch and bound
- randomly generated
- optimal solution
- search tree
- set covering problem
- combinatorial optimization
- boolean satisfiability
- haplotype inference
- finding an optimal solution
- np hard
- combinatorial problems
- evolutionary algorithm
- search space
- knowledge base
- variable ordering
- search algorithm
- max sat
- backtrack search