Graphics processing unit-accelerated bounding for branch-and-bound applied to a permutation problem using data access optimization.
Nouredine MelabImen ChakrounAhcène BendjoudiPublished in: Concurr. Comput. Pract. Exp. (2014)
Keyphrases
- data access
- branch and bound
- upper bound
- search algorithm
- data management
- combinatorial optimization
- lower bound
- search space
- optimal solution
- data transfer
- database applications
- real time
- gpu implementation
- general purpose
- graphics processing units
- optimization problems
- software engineering
- query processing
- bayesian networks
- data mining