Work and Memory-Efficient Parallel Algorithms for the Knapsack Problem.
Afonso FerreiraPublished in: Int. J. High Speed Comput. (1995)
Keyphrases
- memory efficient
- parallel algorithm
- knapsack problem
- combinatorial optimization problems
- optimal solution
- optimization problems
- parallel computation
- dynamic programming
- shared memory
- iterative deepening
- exact algorithms
- external memory
- parallel programming
- combinatorial search problems
- np hard
- multidimensional knapsack problem
- cluster of workstations
- greedy algorithm
- parallel implementations
- pc cluster
- implicit enumeration
- continuous relaxation
- neural network
- lower bound
- vehicle routing problem
- maximum profit
- markov random field