Coping with Anomalies in Parallel Branch-and-Bound Algorithms.
Guo-Jie LiBenjamin W. WahPublished in: IEEE Trans. Computers (1986)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- set covering problem
- randomly generated
- upper bound
- np hard
- search tree
- combinatorial optimization
- finding an optimal solution
- anomaly detection
- optimal solution
- haplotype inference
- boolean satisfiability
- search algorithm
- combinatorial problems
- variable ordering
- linear programming
- constraint satisfaction
- search space
- shared memory
- backtrack search
- neural network