knapsack problem

The knapsack problem is a mathematical optimization problem where you have to select a set of items with certain weights and values that can fit into a knapsack with a limited capacity, in such a way that the total value of the items selected is as high as possible.

Requires login.