Building a parallel branch and bound library.
Mohamed BenaïchoucheVan-Dat CungSalah DowajiBertrand Le CunThierry MautorCatherine RoucairolPublished in: Solving Combinatorial Optimization Problems in Parallel (1996)
Keyphrases
- branch and bound
- branch and bound algorithm
- depth first search
- lower bound
- search algorithm
- upper bound
- optimal solution
- column generation
- search space
- combinatorial optimization
- branch and bound procedure
- beam search
- branch and bound method
- mini bucket
- randomly generated problems
- branch and bound search
- lagrangian heuristic
- tree search
- search strategies
- linear programming relaxation
- network design problem
- tree search algorithm
- objective function
- parallel processing
- max sat
- shared memory
- integer programming problems
- bnb adopt