I'm trying to figure out a variation to the knapsack problem.  The major difference is all objects have a type.  For an example we can call them type A, B, C, D, and E.  In addition to this we have to have a specific amount of each type.  For example get the most value in the knapsack as possible while using 1 item of type A, 2 of type B, 3 of type C, 1 of type D, 1 of type E, and 1 that can be either B, C, or D.Does anyone have a suggestion on how to solve this?
Knapsack Variation (Fixed amount, different types)
algorithms;knapsack problems