Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 50, No. 6, November-December 2002, pp. 968-980
DOI: 10.1287/opre.50.6.968.353
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Aardal, K.
Right arrow Articles by Tiourine, S.
Right arrow Search for Related Content

Algorithms for Radio Link Frequency Assignment: The Calma Project

Karen Aardal, Cor Hurkens, Jan Karel Lenstra, Sergey Tiourine

Department of Mathematics, Utrecht University, Budapestlaan 6, 3584 CD Utrecht, The Netherlands
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 5600 MB Eindhoven, The Netherlands
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 5600 MB Eindhoven, The Netherlands
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 5600 MB Eindhoven, The Netherlands

aardal{at}math.uu.nl
wscor{at}win.tue.nl
jkl{at}win.tue.nl
sergey.tiourine{at}carmen.se

The radio link frequency assignment problem occurs when a network of radio links has to be established. Each link must be assigned an operating frequency from a given domain. The assignment has to satisfy certain restrictions so as to limit the interference between links. The number of frequencies used is to be minimized.

Problems of this type were investigated within the CALMA project 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, and approximation techniques including a variety of local search methods, genetic algorithms, neural networks, and potential reduction. These algorithms were tested and compared on a set of real-life instances.

Subject classifications: Programming/integer: comparison of algorithms. Communications: frequency assignment.
History: Received November 1999; revision received July 2001; accepted October 2001.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2002 by INFORMS.