This is the set of instances used in the paper "J. Castro, Minimum-distance controlled perturbation methods for large-scale tabular data protection, European Journal of Operational Research, 171 (2006) 39-52". A description of the problem and the optimal objective function for each instance can be obtained from the above paper. We provide all the instances for each type of problem: L1, L2, and Linf (see the report for details). L1 and Linf instances are linear problems; L2 are quadratic ones. These linear and quadratic programming instances were produced from the rawdata of CSPLIB , a library for the cell suppression problem maintained by J.J. Salazar.

To install the instances, download either the .zip or .tar.gz files, and "unzip" or "gunzip and untar" them.