XCSP 2.1 Benchmarks

---

fapp36ExtConvert

Lecoutre's category
REAL (Real-World Instances) - FAPP
Lecoutre's tooltips
The Frequency Assignment Problem with Polarization constraints (denoted FAPP) is the optimization problem retained for the ROADEF'2001 challenge . It is one extended subject of the CALMA European project (Combinatorial ALgorithms for Military Applications). In this problem, one can find some constraints concerning the distance between frequencies and depending on their polarizations. For such constraints, a progressive relaxation is authorized: a relaxation level is possible between 0 (no relaxation) and 10 (the maximum relaxation). To obtain a decision problem, one has just to set one of these relaxation levels. In other words, 11 CSP instances can be defined from any original FAPP instance. Series of instances are denoted by fappNB with NB is in 01...40 while individual instances are denoted by fappNB-n-r where n is the number of variables and r is the relaxation level. The higher the value of r is, the less constrained the instance is.
Source
http://www.cril.univ-artois.fr/~lecoutre/research/benchmarks/fapp36-40.tgz
Comments
None

Number of instances: 11 (0 processed, 0 partially processed, 11 failed)

Processing completed

Partially processed

Processing failed
fapp36-2000-0-ext
fapp36-2000-1-ext
fapp36-2000-10-ext
fapp36-2000-2-ext
fapp36-2000-3-ext
fapp36-2000-4-ext
fapp36-2000-5-ext
fapp36-2000-6-ext
fapp36-2000-7-ext
fapp36-2000-8-ext
fapp36-2000-9-ext