The multiple knapsack problem with grouped items aims to maximize rewards by assigning groups of among knapsacks, without exceeding capacities. Either all in a group are assigned or none at all. We study the bi-criteria variation problem, where capacities can be exceeded and second objective is minimize maximum capacity. propose approximation algorithms that run pseudo-polynomial time guarantee...