Solving Standard Quadratic Programming by Cutting Planes

This site hosts the instances used in the paper "Solving Standard Quadratic Programming by Cutting Planes" by Pierre Bonami, Andrea Lodi, Jonas Schweiger, and Andrea Tramontani.

The paper deals with two classes of instances: Standard Quadratic Programs and Quadratic Knapsack Problems.

The instances are free and can be used for research purposes. If you use the instances for your research, please cite the paper as:

Solving Standard Quadratic Programming by Cutting Planes by
Pierre Bonami, Andrea Lodi, Jonas Schweiger, and Andrea Tramontani, submitted

 


Standard Quadratic Programs

Two sets of SQP instances have been used in the paper. The first set was used in a previous publication of A. Scozzari and F. Tardella "A clique algorithm for standard quadratic programming", Discrete Applied Mathematics, 2008 and comprises 14 instances of different sizes. As the download link in the paper is inactive, we republish the instances here.

 - Instances from A. Scozzari and F. Tardella


The second set of instances has be randomly generated. The algorithm to generate the instances is described in Section 6.1 in the paper.
Instances of two sizes d have been used:

 - d = 30 sqp_30
 - d = 50 sqp_50

Furthermore, we provide an enhanced version of the script generateSQP that was used to generate the instances. The script is provided on an as-is basis and we take no responsibilities whatsoever.
 


Quadratic Knapsack Problems

 

Two different types of instances have been used in the paper. The instances are grouped in two testsets: QKP1 and QKP2. The algorithms to generate them are described in Section 7.1 in the paper.
The instances can be downloaded here:

 - QKP1
 - QKP2

Furthermore, we provide an enhanced version of the script generateQKP that was used to generate the instances. The script is provided on an as-is basis and we take no responsibilities whatsoever.