Optimal Parallel Algorithm for the Knapsack Problem Without Memory Conflicts.

Kenli Li Renfa Li Qing-Hua Li

Published in: J. Comput. Sci. Technol. (2004)

Keyphrases

parallel algorithm
knapsack problem
optimal solution
dynamic programming
binary search trees
maximum profit
greedy heuristic
implicit enumeration
combinatorial optimization problems
parallel computation

decision variables
multidimensional knapsack problem
optimization problems
greedy algorithm
shared memory
exact algorithms
medial axis transform
np hard
parallel programming
linear programming relaxation

inter processor communication
discovery of association rules
cluster of workstations
metaheuristic
worst case
continuous relaxation
objective function
parallel version
lower bound
dominant points

neural network
computing power
search space
computational complexity
multicore processors
processor array
reinforcement learning
machine learning
shared memory multiprocessors