A generalized utility for parallel branch and bound algorithms.
Yuji ShinanoMasahiro HigakiRyuichi HirabayashiPublished in: SPDP (1995)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- np hard
- search tree
- randomly generated
- combinatorial optimization
- optimal solution
- boolean satisfiability
- utility function
- set covering problem
- haplotype inference
- finding an optimal solution
- combinatorial problems
- variable ordering
- max sat
- orders of magnitude