Changes between Version 1 and Version 2 of Documentation/Reference/Knapsack Problem

Timestamp:

06/10/10 12:08:39 (15 years ago)

Author:

mkofler

Comment:

--

Documentation/Reference/Knapsack Problem

@@ -1 +1 @@
 = Knapsack Problem =
+In the Knapsack Problem a set of items with an associated weight and value is given. The goal is to select a subset of items that does not exceed the  maximum load of the Knapsack but maximizes the total value of the items.
 
 '''Problem Parameters:'''