GPU-based branch-and-bound method to solve large 0-1 knapsack problems with data-centric strategies.
Jingcheng ShenKentaro ShigeokaFumihiko InoKenichi HagiharaPublished in: Concurr. Comput. Pract. Exp. (2019)
Keyphrases
- data centric
- knapsack problem
- branch and bound method
- business processes
- data management
- mixed integer programming
- optimal solution
- branch and bound
- feasible solution
- data driven
- dynamic programming
- information management
- distributed systems
- optimization problems
- np hard
- lower bound
- reduce the search space
- branch and bound algorithm
- application development
- routing protocol
- greedy algorithm
- xml schema
- data storage
- production planning
- object oriented