XCSP 2.1 Benchmark Database

rlfapScensExtConvert

Lecoutre's category

Lecoutre's tooltips

The Radio Link Frequency Assignment Problem (RLFAP) is the task of assigning frequencies to a number of radio links in such a manner as to simultaneously satisfy a large number of constraints and use as few distinct frequencies as possible. In 1993, the CELAR (the French ``Centre d'Electronique de l'Armement'') built a suite of simplified versions of Radio Link Frequency Assignment Problems starting from data on a real network. These benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications). For more information, see [Cabon-deGivry-Lobjois-Schiex-Warners, Radio Link Frequency Assignment, Constraints 4(1), 1999]. There are five series of binary RLFAP instances, identified as either scen or graph. Following the approach of [Bessiere-Chmeiss-Sais, Neighborhood-based variable ordering heuristics for the constraint satisfaction problem, CP'01], some modified RLFAP instances have been produced by removing some constraints (w followed by a value) and/or some frequencies (f followed by a value). For example, scen07-w1-f4 corresponds to the instance scen07 for which the constraints of weight greater than 1 have not been taken into account and the 4 highest frequencies have been removed. The last series "subs" is interesting for Max-CSP.

Source

Comments

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

Processing completed
normalized-scen2-ext
normalized-scen6-ext

Partially processed
normalized-scen1-ext
normalized-scen10-ext
normalized-scen11-ext
normalized-scen3-ext
normalized-scen4-ext
normalized-scen5-ext
normalized-scen7-ext
normalized-scen8-ext
normalized-scen9-ext

Processing failed

XCSP 2.1 Benchmarks

rlfapScensExtConvert