Description
The Knapsack Problem is well known combinatorial optimization problem where the goal is to maximize the benefit of objects in a knapsack without exceeding its capacity.
Additional information:
https://en.wikipedia.org/wiki/Knapsack_problem