GPU Implementation of the Branch and Bound Method for Knapsack Problems.
Mohamed Esseghir LalamiDidier El BazPublished in: IPDPS Workshops (2012)
Keyphrases
- gpu implementation
- knapsack problem
- branch and bound method
- optimal solution
- branch and bound
- mixed integer programming
- branch and bound algorithm
- production planning
- lower bound
- feasible solution
- np hard
- reduce the search space
- real time
- optimal configuration
- feature tracking
- dynamic programming
- optimization problems
- greedy algorithm
- search algorithm
- column generation
- upper bound
- linear programming
- graphics processing units
- graphics processors
- motion analysis
- lagrangian relaxation
- mixed integer
- lot sizing
- general purpose
- search space
- neural network