Solving Frequency Assignment Problems vi
โ
Arie M.C.A. Koster; Stan P.M. van Hoesel; Antoon W.J. Kolen
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 69 KB
In this extended abstract 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. Wi