Abstract
Determining lower bounds for the sum of weighted constraint violations in fixed spectrum frequency assignment problems is important in order to evaluate the performance of heuristic algorithms. It is well known that, when adopting a binary constraints model, clique and near-clique subproblems have a dominant role in the theory of lower bounds for minimum span problems. In this paper we highlight their importance for fixed spectrum problems. We present a method based on the linear relaxation of an integer programming formulation of the problem, reinforced with constraints derived from clique-like subproblems. The results obtained are encouraging both in terms of quality and in terms of computation time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.M. Allen, D.H. Smith and S. Hurley, Confidential report, University of Glamorgan, Cardiff University (1998).
S.M. Allen, D.H. Smith and S. Hurley, Lower bounding techniques for frequency assignment, Discrete Mathematics 197/198 (1999) 41–52.
L.G. Anderson, A simulation study of some dynamic channel assignment algorithms in high capacity mobile telecommunications system, IEEE Transactions on Communications 21 (1973) 1294–1301.
R. Borndörfer, A. Einsenblätter, M. Grötschel and A. Martin, The orientation model for frequency assignment problems, Technical report TR 98-01, Konrad-Zuse-Zentrum für Informationstechnik Berlin (1998).
C. Bron and J. Kerbosch, Algorithm 457: Finding all cliques of an undirected graph [H], Comm. ACM 16(9) (1973) 575–577.
D.J. Castellino, S. Hurley and N.M. Stephens, Tabu search algorithm for frequency assignment, Annals of Operations Research 63 (1996) 301–319.
C.A.J. Hurkens and S.R. Tiourine, Upper and lower bounding techniques for frequency assignment problems, Technical report COSOR 95-34, Eindhoven University of Technology (1995).
S. Hurley, D.H. Smith and S.U. Thiel, FASoft: A system for discrete channel frequency assignment, Radio Science 32(5) (1997) 1921–1939.
T.R. Jensen and B. Toft, Graph Coloring Problems (Wiley, 1995).
A.M.C.A. Koster, Frequency assignment. Models and algorithms, Ph.D. thesis, Maastricht University (1999).
V. Maniezzo and R. Montemanni, An exact algorithm for the min-interference frequency assignment problem, Technical report WP-CO0003, Universitá degli Studi di Bologna (2000).
R. Montemanni, Algoritmi Esatti ed Euristici per il Problema dell'Assegnamento di Frequenze, Tesi di Laurea, Universitá degli Studi di Bologna (1999) (in Italian).
D.H. Smith, S.M. Allen and S. Hurley, Lower bounds for channel assignment, in: Methods and Algorithms for Radio Channel Assignment, ed. R.A. Leese (Oxford University Press, 2001) to appear.
D.H. Smith and S. Hurley, Bounds for the frequency assignment problem, Discrete Mathematics 167/168 (1997) 571–582.
D.H. Smith, S. Hurley and S.M. Allen, A new lower bound for the channel assignment problem, IEEE Transactions on Vehicular Technology 49(4) (2000) 1265–1272.
D.H. Smith, S. Hurley and S.U. Thiel, Improving heuristics for the frequency assignment problem, European Journal of Operational Research 107 (1998) 76–86.
S. Tiourine, C. Hurkens and J.K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, in: CALMA Symposium on Combinatorial Algorithms for Military Applications (1995) pp. 53-62.
W.J. Watkins, S. Hurley and D.H. Smith, Evaluation of models for area coverage, Research report No. 98003, Cardiff University (December 1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Montemanni, R., Smith, D. & Allen, S. Lower Bounds for Fixed Spectrum Frequency Assignment. Annals of Operations Research 107, 237–250 (2001). https://doi.org/10.1023/A:1014911401612
Issue Date:
DOI: https://doi.org/10.1023/A:1014911401612