I have a few knapsacks of given capacities.
Also, much more items of given weights and values.
As usual, items have to be put into knapsacks to maximize profit.
What is different from a standard MKP, is that there’s a requirement that each knapsack has to be filled completely. I.e. the sum of weights of its items has to be equal to its capacity (while in the standard problem, it is less-than-equal).
How to approach this? (I want to find an algorithm to solve this.)