Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem
DOI10.1016/j.ejco.2021.100024zbMath1530.90114OpenAlexW4200161259MaRDI QIDQ6114925
Andrea Schaerf, Roberto Maria Rosati, Luca Di Gaspero, Sara Ceschia
Publication date: 12 July 2023
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejco.2021.100024
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Heuristic manipulation, tabu search and frequency assignment
- Frequency assignment in cellular phone networks
- Lower bounds for fixed spectrum frequency assignment
- Revisiting simulated annealing: a component-based analysis
- Local search algorithms for the radio link frequency assignment problem
- Tabu search with simple ejection chains for coloring graphs
- An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
- Optimized planning of frequency hopping in cellular networks
- A survey of local search methods for graph coloring
- The stable set problem and the thinness of a graph
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- Algorithms for Radio Link Frequency Assignment: The Calma Project
- The frequency assignment problem: A solution via nonlinear programming
- Solving partial constraint satisfaction problems with tree decomposition
- A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
- Models and solution techniques for frequency assignment problems
This page was built for publication: Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem