These are the instances tested in:
Relaxations and Heuristics for the Multiple Non-Linear Separable Knapsack Problem
by Claudia D’Ambrosio, Silvano Martello, and Luca Mencarelli
The name of each zipfile gives the characterization of:
-- weights (linear, non-linear);
-- variables (integer, real);
-- capacities (similar, dissimilar).
Each zipfile contains 3 folders (for 2, 5, and 10 knapsacks).
Each folder contains 7 sub-folders (for 10, 20, 50, 100, 200, 500, 1000 items).
Each sub-folder contains 20 files, one per instance.
Each file contains the values of:
-- n;
-- m;
-- c_i (i=1, ..., m);
-- a_j, b_j, c_j, d_j (j = 1, ..., n), used to produce profits as in equation (18);
---- for linear weights: w_j (j = 1, ..., n);
---- for non-linear weights: p_j and q_j (j = 1, ..., n) (denoted as weight_a and weight_c, respectively),
used to produce weights as in equation (19);
-- u_j (j = 1, ..., n).