KnapsackProblem
Last edit July 10, 2008
Maximizing the worth (or rather usefulness) of the contents of a knapsack when the maximum weight is limited and different candidate pieces have different weight and worth/usefulness.
See
http://en.wikipedia.org/wiki/Knapsack_problem
See also
OptimalUseOfContainerSpace
,
BinPacking
,
AlgorithmsWanted