Knapsack Definition

In the knapsack problem we are given a set of objects and the capacity of the knapsack. Each object has its size and value.

The goal is to choose a subset of objects of total size not exceeding the capacity, while maximizing the sum of the objects values.

There are two variants of this problem. In the *knapsack* *0/1* problem each object from the objects set can be chosen only once. In the second variant called *knapsack* *unbounded* problem, each object can be chosen many times.

Generated on Tue Jan 31 2017 00:30:51 by 1.8.5