Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm.
Imen ChakrounMohand-Said MezmazNouredine MelabAhcène BendjoudiPublished in: Concurr. Comput. Pract. Exp. (2013)
Keyphrases
- branch and bound algorithm
- gpu accelerated
- lower bound
- branch and bound
- finite element
- upper bound
- np hard
- optimal solution
- lower bounding
- real time
- precedence constraints
- combinatorial optimization
- randomly generated problems
- single machine scheduling problem
- upper bounding
- lagrangian relaxation
- finding an optimal solution
- mixed integer linear programming
- branch and bound method
- sequence alignment
- least squares
- pairwise
- neural network
- variable ordering
- maximum clique