########## DESCRIPTION #########

This web page contains the instances for the Robust Knapsack Problem considered in the following paper

M. Monaci, U. Pferschy, P. Serafini, 
"Exact Solution of the Robust Knapsack Problem",
Computers & Operations Research 40 (11), 2625-2631, 2013.


########## INSTANCES #########

Folder Instances contains the 300 (RKP) instances considered in the paper. 
Each file has name 
	RKP_c_n_class_ind.txt 
where:
-- c denotes the knapsack capacity
-- n denotes the number of items
-- class denotes the type of instances, as follows: 1 uncorrelated, 2 weakly correlated, 3 strongly correlated, 4 inverse correlated, 5 subset sum
-- ind is a counter between 1 and 10 

The format of each file is as follows
-- number of items n
-- n lines, one per item, each containing
	(i)   a progressive index
	(ii)  the profit of the item
	(iii) the nominal weight of the item
	(iv)  the robust weight of the item
-- the last line contains the capacity of the knapsack

########## SOLUTIONS #########

Folder Solutions contains the solution of each instance for each tested value of \Gamma \in \{1, 10, 50\} -- thus, 900 solutions in total.
Each file has name 
	SOL_Gamma_input
where:
-- Gamma denotes the max number of items that may change their weight
-- input is the name of the (RKP) instance, as described below

The format of each file is as follows
-- the first line contains the optimal solution value
-- then there is a line for each item that is inserted in the optimal solution.
   Each such line contains:
	(i)   the index of the item
	(ii)  the profit of the item
	(iii) the nominal weight of the item
	(iv)  the max weight increase of the item
	(v)   if the item is among the \Gamma with max weight increase it is marked with 
              an asterisk * and its robust weight (i.e., weight in the robust solution) is given.