An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms.
Michael J. QuinnNarsingh DeoPublished in: BIT (1986)
Keyphrases
- upper bound
- branch and bound algorithm
- lower bound
- branch and bound
- lower bounding
- worst case
- randomly generated
- search tree
- combinatorial problems
- variable ordering
- max sat
- lower and upper bounds
- upper bounding
- objective function
- np hard
- optimal solution
- vc dimension
- orders of magnitude
- set covering problem
- haplotype inference
- neural network
- linear programming relaxation
- boolean satisfiability