Radio link frequency assignment - Archive ouverte HAL Access content directly
Journal Articles Constraints Year : 1999

Radio link frequency assignment

(1) , (1) , (1) , (2) , (3)
1
2
3

Abstract

The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NP-hard) optimization problem. In 1993, the CELAR (the French “Centre d'Electronique de l'Armement”) built a suite of simplified versions of Radio Link Frequency Assignment Problems (RLFAP) starting from data on a real network Roisnel93. Initially designed for assessing the performances of several Constraint Logic Programming languages, these benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications). These problems should look very attractive to the CSP community: the problem is simple to represent, all constraints are binary and involve finite domain variables. They nevertheless have some of the flavors of real problems (including large size and several optimization criteria). This paper gives essential facts about the CELAR instances and also introduces the GRAPH instances which were generated during the CALMA project.

Dates and versions

hal-02695373 , version 1 (01-06-2020)

Identifiers

Cite

Bertrand Cabon, Simon de Givry, Lionel Lobjois, Thomas Schiex, Joost P. Warners. Radio link frequency assignment. Constraints, 1999, 4 (1), pp.79-89. ⟨10.1023/A:1009812409930⟩. ⟨hal-02695373⟩

Collections

INRA INRAE MATHNUM
29 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More