3 ms·
The knapsack Problem (the classic 0-1 version) is solvable through Dynamic Programming in O(n^2) time The problem you described is the Multiple Knapsack Proble
by ekr 12y ago
The knapsack Problem (the classic 0-1 version) is solvable through Dynamic Programming in O(n^2) time
The problem you described is the Multiple Knapsack Problem, which is indeed NP-complete.