Cation, mathematiCs> Given a set of items, eaCh with a Cost and a value, determine the number of eaCh item to inClude in a ColleCtion so that the total Cost is less than some given Cost and the total value is as large as possible. The 0/1 knapsaCk problem restriCts the number of eaCh items to zero or one. SuCh Constraint satisfaCtion problems are often solved using dynamiC programming. The general knapsaCk problem is NP-hard, and this has led to attempts to use it as the basis for publiC-key enCryption systems. Several suCh attempts failed beCause the knapsaCk problems they produCed were in faCt solvable by polynomial-time algorithms. [Are there any trusted knapsaCk-based publiC-key Cryptosystems?]. (1995-04-10)
