Title :
A parallel algorithm for solving the knapsack problem on the cluster
Author :
He, Yan ; Li, Ken-Li ; Liu, Xjao-Ling ; Wang, Ying
Author_Institution :
Coll. of Comput. & Commun., Hunan Univ., Changsha, China
Abstract :
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.
Keywords :
computational complexity; knapsack problems; parallel algorithms; NP-complete problem; cluster knapsack problem; parallel algorithm; two-list algorithm; Algorithm design and analysis; Clustering algorithms; Concurrent computing; Costs; Educational institutions; Helium; Large-scale systems; NP-complete problem; Parallel algorithms; Public key cryptography;
Conference_Titel :
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN :
0-7803-8403-2
DOI :
10.1109/ICMLC.2004.1382211
