Technical Note - On the Expected Performance of Branch-and-Bound Algorithms.
Jan Karel LenstraA. H. G. Rinnooy KanPublished in: Oper. Res. (1978)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- upper bound
- haplotype inference
- search tree
- np hard
- optimal solution
- set covering problem
- combinatorial optimization
- combinatorial problems
- boolean satisfiability
- search algorithm
- neural network
- search space
- computational complexity
- max sat
- finding an optimal solution