Subset Sum Problem and Knapsack Problem

Subset Sum Problems:

1. Wikipedia's definition
2. Some variants
* as close to the target
* not greater than
3. some other constraints
* minimize the size of the subset
* maximize the size of the subset (seems to be not that practical)

4. Some test cases

10, 11, 12, 15, 20, 21, 22, 23, 24, 29

public final static int[] items = {
61, 93, 15, 20, 1, 13, 32, 37, 91, 73, 25, 56, 7, 34, 22, 41, 44, 6, 14, 82};
252 / 767

5. Other codes
http://www.diku.dk/~pisinger/subsum.c


6. Some other variants and application

A Polynomial time Approximate Scheme