A systolic algorithm for solving knapsack problems

@article{Lin1994ASA,
  title={A systolic algorithm for solving knapsack problems},
  author={Chau-Jy Lin and Sheue-Jiau Chen},
  journal={International Journal of Computer Mathematics},
  year={1994},
  volume={54},
  pages={23-32}
}
A systolic algorithm for solving the 0/1-knapsack problems with n items is presented. The computational model used is a tree structure which consists of 2" identical processing elements (PEs). Each PE executes the same program at any time step. The time complexity varies from n to 3n — 2 steps which includes all the input/output data communication time. The design process and the correctness verification of this algorithm are considered in detail. 
1 Citations
A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem
  • 5
  • Highly Influenced
  • PDF

References

SHOWING 1-7 OF 7 REFERENCES
Parallel generation of permutations on systolic arrays
  • 11
Efficient systolic algorithm for finding bridges in a connected graph
  • 9
On the design of algorithms for VLSI systolic arrays
  • 413
  • PDF
Polynomial Division on Systolic Arrays
  • 17
Why systolic architectures?
  • 2,212
  • PDF