Paper: Heuristics for the 0-1 multiple knapsack problem,
by M. E. Lalami, M. Elkihel, D. El Baz, V. Boyer,
LAAS report 10035,
submitted to International Journal of Mathematics in Operational Research.

The data file contains 1500 test problems with similar and dissimilar capacities. Ten instances are proposed for the same type of problem.

The format of this data file is given as follows:
number of variables (n), number of knapsacks (m),
weight w(j), j in {1,..,n},
profit p(j), j in {1,..,n}.
the capacities c(i), i in {1,...,m}.