INSTANCE:
n set sizes specified by an n-vector ,
m knapsacks with different volumes and number of compartments
specified by two m-vectors
,
such that
.
SOLUTION:
A placement of the set elements into the knapsacks, specified by
two -matrices:
,
such that:
and
for every j,
for every i, and
for every (i,j).
MEASURE:
Total number of packed elements, i.e.,
.
Good News:
Approximable with an absolute error guarantee of
[437].