# One variant of the Knapsack Problem

We have a normal knapsack problem but we can choose up to $t_i$ of the $i$-th object. How would you solve this problem with complexity less than $O(V(n + \sigma(t_i)))$ where $n$ is number of objects and $V$ is the total volume?

• It seems the problem is NP-complete if all t_i are equal to 1. – gnasher729 Oct 28 '16 at 21:57
• What does $\sigma(t_i)$ represent? – D.W. Oct 29 '16 at 5:00