A Parallel Time/Hardware Tradeoff T . H = O(2^{n/2}) for the Knapsack Problem.
Afonso FerreiraPublished in: IEEE Trans. Computers (1991)
Keyphrases
- knapsack problem
- parallel hardware
- combinatorial optimization problems
- optimal solution
- massively parallel
- optimization problems
- dynamic programming
- computer architecture
- exact algorithms
- np hard
- multidimensional knapsack problem
- parallel architectures
- linear programming relaxation
- low cost
- bicriteria
- multi core processors
- np hard problems
- heuristic solution
- parallel computation
- maximum profit
- implicit enumeration
- continuous relaxation
- parallel implementation
- processing elements
- processing units
- parallel processing
- greedy heuristic
- graphics processing units
- parallel computing
- greedy algorithm
- randomly generated test instances
- computational complexity