many-core computing for many-task Branch-and-Bound applied to big optimization problems.
Nouredine MelabJan GmysMohand-Said MezmazDaniel TuyttensPublished in: Future Gener. Comput. Syst. (2018)
Keyphrases
- branch and bound
- branch and bound algorithm
- optimization problems
- lower bound
- search algorithm
- combinatorial optimization
- upper bound
- column generation
- branch and bound procedure
- evolutionary algorithm
- search space
- optimal solution
- branch and bound method
- tree search
- traveling salesman problem
- beam search
- tree search algorithm
- special case
- depth first search
- mixed integer programming
- max sat
- partial solutions
- metaheuristic