An efficient heuristic for the expansion problem of cellular wireless networks

DOI10.1016/S0305-0548(03)00119-9zbMath1068.68012MaRDI QIDQ1885950

Steven Chamberland

Publication date: 12 November 2004

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

zbMATH Keywords

Tabu searchCellular networksFacility location and type selectionTopological expansion

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic, A New Approximative Algorithm for the Expansion Problem of 3G Networks, Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue

Uses Software

• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
• Design of partially survivable networks for cellular telecommunication systems
• On tabu search for the location of interacting hub facilities
• A multi-period network design problem for cellular telecommunication systems