A parallel algorithm for the integer knapsack problem
Published in Concurrency Practice and Experience • May 1, 1996
Authors:,,
D. Morales
José L. Roda
C. Rodrı́guez
Abstract
A sequential algorithm with complexity O(M2+n) for the integer knapsack problem is presented. M is the capacity of the knapsack, and n the number of objects. The algorithm admits an efficient parallelization on a p-processor ring machine. The corresponding parallel algorithm is O(M2/p+n). The parall...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!