I wonder what relations are between the knapsack problem, the bin packing problem and the set packing problem?
From their mathematical formulations, I don't see the first two belong to the third one i.e. the set packing problem, although I feel the third one sounds more general than the other two.
Or under what conditions there are some conversions between each other?
Thanks!
