Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
The partial constraint satisfaction problem: Facets and lifting theorems
Operations Research Letters
Specializing Russian Doll Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Minimizing fuel cost in gas transmission networks by dynamic programming and adaptive discretization
Computers and Industrial Engineering
| Hi-index | 0.00 |
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.