Algorithms for frequency assignment problems

K.I. Aardal, C.A.J. Hurkens, J.K. Lenstra, S.R. Tiourine

Research output: Contribution to journalArticleAcademicpeer-review

2 Downloads (Pure)

Abstract

Frequency assignment problems occur when a network of radio links has to be established. Each link has to be assigned an operating frequency from a set of available frequencies. The assignment has to satisfy certain interference limiting restrictions defined on pairs of links. Moreover, the number of frequencies used is to be minimized. These problems have been investigated by a consortium consisting of research groups from Delft, Eindhoven, London, Maastricht, Norwich, and Toulouse. The participants developed optimization algorithms based on branch-and-cut and constraint satisfaction, as well as approximation techniques such as simulated annealing, taboo search, variable-depth search, genetic algorithms, and potential reduction methods. These algorithms were tested and compared on a set of real-life instances.
Original languageEnglish
Pages (from-to)1-8
JournalCWI Quarterly
Volume9
Issue number1-2
Publication statusPublished - 1996

Fingerprint Dive into the research topics of 'Algorithms for frequency assignment problems'. Together they form a unique fingerprint.

Cite this