O. Shcherbina et al., Benchmarking global optimization and constraint satisfaction codes (2003).

The COCONUT benchmark is intended as a test set of continuous global optimization problems. Therefore, some of the original problems, that contained integer constraints, were relaxed to continuous problems for the purpose of this test set. Especially, this concerns the problems ex9_1_3, ex9_1_6, ex9_1_7, and ex9_1_9 from Library 1, avgasa, avgasb, and batch from Library 2, and weapon from Library 3.
 

LIBRARY 1 (GLOBAL OPTIMIZATION PROBLEMS from the GLOBAL Library, collected by GAMS)

Table of Problems, with summary statistics

tar.gz file of Library 1 problems in AMPL format.

tar.gz file of Library 1 problems in GAMS format;

tar.gz file of Library 1 problems in DAG format;

The handbook problems for global optimization, collected by Floudas et al., corrected by Oleg Shcherbina
 

LIBRARY 2 (GLOBAL OPTIMIZATION PROBLEMS from the CUTE subcollection of Nonlinear Optimization Models in AMPL, collected by Bob Vanderbei)

Table of Problems, with summary statistics

LIBRARY 3 (CONSTRAINT SATISFACTION TEST PROBLEMS) collected by LIA (EPFL)

Table of Problems, with summary statistics

Table of Problems on LIA site (click on subcategories to get more details than in the previous list)

tar.gz file of Library3 problems in AMPL format


tar.gz file of Library 3 problems in GAMS format

tar.gz file of Library 3 problems in DAG format

Program for calculating the (revised) Standard Unit Time

Complexity classes and associated problem ordering