Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic
DOI10.1016/j.cor.2013.02.017zbMath1348.90448OpenAlexW2144950844MaRDI QIDQ336426
Marc St-Hilaire, Mohammad Reza Pasandideh
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.017
optimizationheuristicsnetwork planningall-IPmixed integer programming (MIP)third generation (3G) mobile networksuniversal mobile telecommunications system (UMTS)
Mixed integer programming (90C11) Communication networks in operations research (90B18) Case-oriented studies in operations research (90B90) Traffic problems in operations research (90B20)
Uses Software
Cites Work
- Hybrid metaheuristics. An emerging approach to optimization.
- A tabu search algorithm for the global planning problem of third generation mobile networks
- Solving a minimum-power covering problem with overlap constraint for cellular network design
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Optimal base station positioning and channel assignment for 3G mobile networks by integer programming
- An efficient heuristic for the expansion problem of cellular wireless networks
- Two new algorithms for UMTS access network topology design
- Optimizing revenue in CDMA networks under demand uncertainty
- Uplink UMTS network design -- an integrated approach
- Optimization of Base Stations Positioning in Mobile Networks
This page was built for publication: Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic