A New Approximative Algorithm for the Expansion Problem of 3G Networks

DOI10.3138/INFOR.47.2.105OpenAlexW2159736504MaRDI QIDQ6160200

Marc St-Hilaire

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.47.2.105

zbMATH Keywords

tabu searchheuristic algorithmcellular networksuniversal mobile telecommunications system (UMTS)3Gexpansion (update) problemnetwork planning and optimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

A reliable model for global planning of mobile networks

Cites Work

• Unnamed Item
• A tabu search algorithm for the global planning problem of third generation mobile networks
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• An efficient heuristic for the expansion problem of cellular wireless networks
• Uplink UMTS network design -- an integrated approach
• Tabu Search—Part I
• Robust tower location for code division multiple access networks

This page was built for publication: A New Approximative Algorithm for the Expansion Problem of 3G Networks