Paper: A dynamic programming method with list for the knapsack sharing problem,
by V. Boyer, D. El Baz, M. Elkihel,
LAAS report: 09744
submitted to Computers & Industrial Engineering, 2010.

The data file contains 240 test problems that come from the papers:

The knapsack sharing problem: an exact algorithm,
by M. Hifi and S. Sadfi,
published in the Journal of Combinatorial Optimization,
Vol. 6, pp 35-54, 2002.

and

An exact algorithm for the knapsack sharing problem,
by M. Hifi, H. M'Halla and S. Sadfi,
published in Computers and Operations Research,
Vol. 32, pp 1311-1324, 2005.

The format of this data file is given as follows:
number of variables (n), number of class (m),
the capacity,
the number of variables in each class (n(i), i in 1,...,m),
profit p(ij) and weight w(ij), j in {1,..,n(i)} for each class i in {1,...,m}.


Instances