Heuristic manipulation, tabu search and frequency assignment

DOI10.1016/j.cor.2008.08.006zbMath1173.90449OpenAlexW2035448376MaRDI QIDQ1038293

Roberto Montemanni, Derek H. Smith

Publication date: 17 November 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.006

zbMATH Keywords

tabu searchfrequency assignmentheuristic manipulation

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks ⋮ Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem ⋮ An optimisation model for minimising changes in frequency allocations

Uses Software

• CALMA
• FASoft

Cites Work

• Unnamed Item
• A heuristic manipulation technique for the sequential ordering problem
• Lower bounds for fixed spectrum frequency assignment
• Tabu search for frequency assignment in mobile radio networks
• The stable set problem and the thinness of a graph
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• An Introduction to Tabu Search
• Models and solution techniques for frequency assignment problems

This page was built for publication: Heuristic manipulation, tabu search and frequency assignment