A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions.
Ten-Hwang LaiAlan P. SpraguePublished in: Inf. Process. Lett. (1986)
Keyphrases
- branch and bound algorithm
- upper bound
- lower bound
- branch and bound
- randomly generated
- anomaly detection
- np hard
- optimal solution
- set covering problem
- combinatorial optimization
- search tree
- search algorithm
- max sat
- boolean satisfiability
- haplotype inference
- finding an optimal solution
- variable ordering
- temporal logic