Parallel Processing Symposium, International (1997)
Apr. 1, 1997 to Apr. 5, 1997
In this paper, we present a new algorithm to solve the integral knapsack problem on the hypercube. The main idea is to use the fact that the precedence graph of the dynamic programming function of the knapsack problem is an irregular mesh. We propose a scheduling algorithm for irregular meshes on the hypercube. The efficiency of the algorithm is independent on the number of processors. We also present some improvements for the solution of the 0/1 knapsack problem on the hypercube.
A. Goldman and D. Trystram, "An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube," Parallel Processing Symposium, International(IPPS), Geneva, SWITZERLAND, 1997, pp. 608.