Solving a minimum-power covering problem with overlap constraint for cellular network design

DOI10.1016/j.ejor.2009.09.018zbMath1177.90067OpenAlexW2024660437MaRDI QIDQ1046080

Lei Chen, Di Yuan

Publication date: 21 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.09.018

zbMATH Keywords

coveringinteger programmingtabu searchcellular networksOR in telecommunications

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Communication networks in operations research (90B18)

Related Items (3)

Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic ⋮ On optimization formulations for radio resource allocation subject to common transmission rate ⋮ Telecommunications network design: Technology impacts and future directions

Uses Software

• CALMA
• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Optimizing base station location and configuration in UMTS networks
• Partial integration of frequency allocation within antenna positioning in GSM mobile networks
• Optimal base station positioning and channel assignment for 3G mobile networks by integer programming
• Optimisation of the interconnecting network of a UMTS radio mobile telephone system
• A rolling window optimization method for large-scale WCDMA base stations planning problem
• Two new algorithms for UMTS access network topology design
• Optimizing revenue in CDMA networks under demand uncertainty
• UMTS radio network evaluation and optimization beyond snapshots
• Models and solution techniques for frequency assignment problems

This page was built for publication: Solving a minimum-power covering problem with overlap constraint for cellular network design