Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms.
Yuji ShinanoKenichi HaradaRyuichi HirabayashiPublished in: IPPS (1997)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- search tree
- np hard
- upper bound
- combinatorial optimization
- set covering problem
- optimal solution
- haplotype inference
- max sat
- utility function
- finding an optimal solution
- variable ordering
- boolean satisfiability
- shared memory
- combinatorial problems
- search algorithm