ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2018-2019): c. 84%
Mathematicae Graph Theory 22(1) (2002) 51-88DOI: 10.7151/dmgt.1158
Andreas Eisenblätter, Martin Grötschel and Arie M.C.A. Koster
Konrad-Zuse-Zentrum für Informationstechnik Berlin
Takustraße 7, D-14195 Berlin, Germany
The ability to produce good frequency plans in practice is essential for the quality of mobile phone
networks. The present algorithmic solution methods employ variants of some of the traditional coloring
heuristics as well as more sophisticated machinery from mathematical programming. This paper will also address
Finally, this paper discusses several practical frequency assignment problems in detail, states the
associated mathematical models, and also points to public electronic libraries of frequency assignment
problems from practice. The associated graphs have up to several thousand vertices and range form rather
sparse to almost complete.
Keywords: frequency assignment, graph coloring.
2000 Mathematics Subject Classification: 05-02, 05C90, 90-02, 05C15.
Received 4 January 2001
Revised 7 June 2001