I have researched and am familiar with a few optimization problems. However, I can't seem to find material on what I'm attempting to solve in python.
Suppose you have 8 items of varying weight.
1;128 2;0 3;130 4;186 5;0 6;0 7;12 8;12
Let's say I have an unlimited amount of 'knapsacks'. I can only use 2 different items to fill each knapsack which can only hold a value of 90. Each time I load the knapsacks, I would like to then come back and make another pass with the remaining values.
For example: On the first pass, I can fit item 1 into a knapsack, item 3 in a knapsack, and item 4 in a knapsack.
On the next pass, even though I took 90 away from item 4, item 4 still holds a value of over 90, and I can put item 4 in another knapsack.
Is there is a specific term for this particular problem or a common solution? I would greatly appreciate any direction.