An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem

DOI10.1016/S0377-2217(03)00127-9zbMath1107.90389MaRDI QIDQ1877917

Stuart M. Allen, Roberto Montemanni, Derek H. Smith

Publication date: 19 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00127-9

zbMATH Keywords

Integer programming; Lower bounds; Radio frequency assignment

Mathematics Subject Classification ID

90C10: Integer programming

90C27: Combinatorial optimization

90B80: Discrete location and assignment

Related Items

Models and solution techniques for frequency assignment problems, Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem, Upper and lower bounds based on linear programming for the b-coloring problem, An optimisation model for minimising changes in frequency allocations, Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization

Uses Software

• Algorithm 457

Cites Work

• Lower bounding techniques for frequency assignment
• Improving heuristics for the frequency assignment problem
• The partial constraint satisfaction problem: Facets and lifting theorems
• Lower bounds for fixed spectrum frequency assignment
• A tabu search algorithm for frequency assignment
• A Spectral Bundle Method for Semidefinite Programming
• Algorithm 457: finding all cliques of an undirected graph