Solving frequency assignment problems via tree-decomposition
From MaRDI portal
Recommendations
- A comparison of problem decomposition techniques for the FAP
- An enumerative algorithm for the frequency assignment problem
- Models and solution techniques for frequency assignment problems
- Frequency assignment in cellular phone networks
- A Decomposed Approach for the Minimum Interference Frequency Assignment
Cites work
Cited in
(11)- A comparison of problem decomposition techniques for the FAP
- Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- A comparison of a global approach and a decomposition method for frequency assignment in multibeam satellite systems
- Tree decompositions of graphs: saving memory in dynamic programming
- Adapting the directed grid theorem into an FPT algorithm
- A Decomposed Approach for the Minimum Interference Frequency Assignment
- Soft arc consistency revisited
- Elementary landscape decomposition of the frequency assignment problem
- Solving partial constraint satisfaction problems with tree decomposition
- Computational protein design as an optimization problem
This page was built for publication: Solving frequency assignment problems via tree-decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741347)