Is there any way for solving the Knapsack problem when we are limited by several constraints?
Let's assume that we have a set of items in which we have value
v that we want to maximize and we also have two constraints
volume that must be lower or equal than the values
My question is, can this problem be solved using dynamic programming?