论文信息 - Optimal Solutions for Frequency Assignment Problems via Tree Decomposition

Optimal Solutions for 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. With the use of several dominance and bounding techniques it is possible to solve small and medium-sized 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-sized instances within reasonable time and memory limits.

Arie M. C. A. Koster | Stan P. M. van Hoesel | Antoon W. J. Kolen

[1] Arie M. C. A. Koster,et al. Solving frequency assignment problems via tree-decomposition , 1999 .

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

[3] Jan Karel Lenstra,et al. Local search algorithms for the radio link frequency assignment problem , 2000, Telecommun. Syst..

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

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

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

[7] Paul D. Seymour,et al. Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

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

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

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