1. Introduction: Unterschied zwischen den Versionen

[unmarkierte Version]

@@ Zeile 1: / Zeile 1: @@
-The Knapsack-problem is a optimizing problem. There is a quantity of objects and every object has weight and a benefit.
-Then you choose a subset of these objects. This subset shouldn't pass a maximum level of weight. Under these condition you chose the subset which has the best benefit.
-This Problem is also called "backpack-problem" becaus it results from an example in which a hiker has to pack his backpack. He has to answer the question :how can I fill the 50 liter space of the backpack to get an optimal benefit.

Aktuelle Version vom 27. Juni 2013, 12:52 Uhr