A parallel algorithm for solving the knapsack problem on the cluster

The knapsack problem is an NP-complete problem. Its resolution for large-scale instances requires prohibitive processing time. Lots of algorithms are proposed, but none is based on the cluster. A parallel algorithm for the knapsack problem based on the cluster and the two-list algorithm is introduced in this paper. With a proper number of processors, the communication cost is reduced to an appropriate proportion.