Performances of Parallel Branch and Bound Algorithms with Best-first Search.
Bernard MansCatherine RoucairolPublished in: Discret. Appl. Math. (1996)
Keyphrases
- branch and bound algorithm
- branch and bound
- search tree
- depth first search
- lower bound
- optimal solution
- upper bound
- randomly generated
- search algorithm
- combinatorial optimization
- tree search
- boolean satisfiability
- set covering problem
- column generation
- search space
- np hard
- haplotype inference
- constraint satisfaction problems
- finding an optimal solution
- search strategies
- heuristic search
- cost function
- linear programming
- hill climbing
- logic programs
- neural network
- variable ordering
- orders of magnitude
- logic programming