
 Chi H. - 2010-10-04 19:47:47 - 
In reply to message 2 from Chi H. 
> http://rosettacode.org/wiki/Knapsack_problem/0-1
It's about packing a knapsack, but with only 1-dimensional items, i.e. item x has a weight, but no value. Or imagine to load a truck with item x with has a weight but no value, nor width x height x depth. Because of the unlimited possible combinations of items an knapsacks this is NP-Problem.