Affordable Access

Reduction Algorithm for Zero-One Single Knapsack Problems

  • Computer Science


A simple algorithm is described for the reduction of 0-1 single knapsack problems to significantly smaller problems. The time required by the reduction algorithm is proportional to the number of variables. When used in conjunction with available algorithms for knapsack problems it substantially reduces total time and space requirements.

There are no comments yet on this publication. Be the first to share your thoughts.