Optimized planning of frequency hopping in cellular networks

DOI10.1016/S0305-0548(03)00210-7zbMath1061.90013MaRDI QIDQ1886738

Di Yuan, Patrik Björklund, Peter Värbrand

Publication date: 19 November 2004

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

zbMATH Keywords

Simulated annealingTelecommunicationsFrequency hoppingFrequency assignment

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem ⋮ Lagrangean relaxation with clusters for point-feature cartographic label placement problems ⋮ Models and solution techniques for frequency assignment problems

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulated annealing: A tool for operational research
• Lower bounding techniques for frequency assignment
• Improving heuristics for the frequency assignment problem
• Applied simulated annealing
• Frequency assignment in cellular phone networks
• A tabu search algorithm for frequency assignment
• Algorithms for Radio Link Frequency Assignment: The Calma Project

This page was built for publication: Optimized planning of frequency hopping in cellular networks