Local search algorithms for the radio link frequency assignment problem
From MaRDI portal
Publication:1854809
DOI10.1023/A:1019100324508zbMath1076.90515MaRDI QIDQ1854809
Jan Karel Lenstra, S. R. Tiourine, Cor A. J. Hurkens
Publication date: 2000
Published in: Telecommunication Systems (Search for Journal in Brave)
Communication networks in operations research (90B18) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
A linear-time transformation of linear inequalities into conjunctive normal form ⋮ Frequency reassignment problem in mobile communication networks ⋮ Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem ⋮ A variable depth search branching ⋮ Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem ⋮ Frequency assignment in mobile radio systems using branch-and-cut techniques
This page was built for publication: Local search algorithms for the radio link frequency assignment problem
