Compilation: javac Knapsack.java
Execution: java Knapsack N W
Generates an instance of the 0/1 knapsack problem with N items
and maximum weight W and solves it in time and space proportional
to N * W using dynamic programming.
http://code.google.com/p/google-collections/
Apache License 2.0
The Permutations class provides an iteration of all permutations of an list
of objects.