Solving a minimum-power covering problem with overlap constraint for cellular network design
type: Item
instance of: scholarly article
title: Solving a minimum-power covering problem with overlap constraint for cellular network design
zbMATH Open document ID: 1177.90067
author: Lei Chen
author: Di Yuan
published in: European Journal of Operational Research
publication date: 2009-12-21T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5650815
zbMATH Keywords: OR in telecommunications
zbMATH Keywords: cellular networks
zbMATH Keywords: covering
zbMATH Keywords: integer programming
zbMATH Keywords: tabu search
describes a project that uses: CPLEX
describes a project that uses: Tabu search
describes a project that uses: CALMA
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.09.018
OpenAlex ID: W2024660437
cites work: Models and solution techniques for frequency assignment problems
cites work: Optimizing base station location and configuration in UMTS networks
cites work: Q4398380
cites work: UMTS radio network evaluation and optimization beyond snapshots
cites work: Optimisation of the interconnecting network of a UMTS radio mobile telephone system
cites work: Two new algorithms for UMTS access network topology design
cites work: Q4354785
cites work: Optimal base station positioning and channel assignment for 3G mobile networks by integer programming
cites work: Optimizing revenue in CDMA networks under demand uncertainty
cites work: Partial integration of frequency allocation within antenna positioning in GSM mobile networks
cites work: A rolling window optimization method for large-scale WCDMA base stations planning problem
DOI: 10.1016/J.EJOR.2009.09.018
description: scientific article; zbMATH DE number 5650815