Lower bounds for fixed spectrum frequency assignment
From MaRDI portal
Publication:1599346
DOI10.1023/A:1014911401612zbMath1015.90069OpenAlexW1979800310MaRDI QIDQ1599346
Derek H. Smith, Stuart M. Allen, Roberto Montemanni
Publication date: 9 June 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014911401612
Related Items (9)
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem ⋮ Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem ⋮ Upper and lower bounds based on linear programming for the b-coloring problem ⋮ Maximum independent sets and supervised learning ⋮ An optimisation model for minimising changes in frequency allocations ⋮ Domination analysis of greedy heuristics for the frequency assignment problem. ⋮ Models and solution techniques for frequency assignment problems ⋮ Performance evaluation and system optimization of Green cognitive radio networks with a multiple-sleep mode ⋮ Heuristic manipulation, tabu search and frequency assignment
This page was built for publication: Lower bounds for fixed spectrum frequency assignment
