Optimal solutions for frequency assignment problems via tree decomposition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1665, Issue , 1999, Pages 338-350

  Koster, Arie M C A ^a   Van Hoesel, Stan P M ^a   Kolen, Antoon W J ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; FORESTRY; FREQUENCY ALLOCATION; ITERATIVE METHODS;

BOUNDING TECHNIQUES; COMPUTATIONAL STUDIES; DYNAMIC PROGRAMMING ALGORITHM; FREQUENCY ASSIGNMENT PROBLEM; INTERFERENCE CONSTRAINTS; LOWER BOUNDS; OPTIMAL SOLUTIONS; TREE DECOMPOSITION;

TREES (MATHEMATICS);

EID: 0013436434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46784-x_32     Document Type: Conference Paper

References (10)

1. S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddins in a k-tree. SIAM Journal on Algebraic and Discrete Methods, 8:277-284, 1987. 341
2. H.L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11(1-2):1-21, 1993. 339
3. H.L. Bodlaender. "A linear time algorithm for finding tree-decompositions of small treewidth". SIAM Journal on Computing, 25(6):1305-1317, 1996. 341
4. D.J. Castelino, S. Hurley, and N.M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Research, 63:301-319, 1996. 339
5. A. Kolen. A genetic algorithm for frequency assignment. Technical report, Maastricht University, 1999. Available at http://www.unimaas.nl/˜akolen/. 339, 347
6. A.M.C.A. Koster, C.P.M. van Hoesel, and A.W.J. Kolen. The partial constraint satisfaction problem: Facets and lifting theorems. Operations Research Letters, 23(3-5):89-97, 1998. 339, 341
7. A.M.C.A. Koster, C.P.M. van Hoesel, and A.W.J. Kolen. Solving frequency assignment problems via tree-decomposition. Technical Report RM 99/011, Maastricht University, 1999. Available at http://www.unimaas.nl/˜akoster/. 340, 341, 343, 346
8. N. Robertson and P.D. Seymour. Graph minors. II. algorithmic aspects of tree width. Journal of Algorithms, 7:309-322, 1986. 339, 341
9. 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, pages 53-62, 1995. Available at http://www.win.tue.nl/math/bs/combopt/hurkens/calma.html. 339
10. S. R. Tiourine, C.A.J. Hurkens, and J.K. Lenstra. Local search algorithms for the radio link frequency assignment problem. Telecommunication systems, to appear, 1999. 339, 339