Solving frequency assignment problems via tree-decomposition

In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. We show that with the use of several dominance and bounding techniques it is possible to solve small and medium-size real-life instances of the frequency assignment problem to optimality. Moreover, with an iterative version of the algorithm we obtain good lower bounds for large-size instances within reasonable time and memory limits

[1]  Cor A. J. Hurkens,et al.  An overview of algorithmic approaches to frequency assignment problems , 1995 .

[2]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Stephen Hurley,et al.  A tabu search algorithm for frequency assignment , 1996, Ann. Oper. Res..

[5]  Brigitte Jaumard,et al.  Comparison of column generation models for channel assignment in cellular networks , 2001, Discret. Appl. Math..

[6]  B. Jansen,et al.  A branch-and-cut algorithm for the frequency assignment problem , 1996 .

[7]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[8]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[9]  Martin Grötschel,et al.  Frequency assignment in cellular phone networks , 1998, Ann. Oper. Res..

[10]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[11]  Arie M. C. A. Koster,et al.  The partial constraint satisfaction problem: Facets and lifting theorems , 1998, Oper. Res. Lett..

[12]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[13]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[14]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[15]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[16]  Caj Cor Hurkens,et al.  Upper and lower bounding techniques for frequency assignment problems , 1995 .