A Parallel Algorithm for the Integer Knapsack Problem for Pipeline Networks
暂无分享，去创建一个
A new sequential algorithm with complexity O(M2 + n) for the Integer Knapsack Problem is proposed. M denotes the capacity M and n the number of objects. The correspondent O(M2/p + n) parallel algorithm runs on a ring machine with p processors. Computational results on a transputer network are reported.
[1] Dan I. Moldovan,et al. Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.
[2] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[3] Gary L. Miller,et al. Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits , 1986, SIAM J. Comput..
[4] Shang-Hua Teng,et al. Adaptive Parallel Algorithms for Integral Knapsack Problems , 1990, J. Parallel Distributed Comput..