Combinatorial optimization algorithms for radio network planning

DOI10.1016/S0304-3975(00)00245-0zbMath0974.68169MaRDI QIDQ5941516

Pierre Kuonen, F. Guidec, Patrice Calégari, Frank Nielsen

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationparallel computinggenetic algorithmset systemradio transceiver siting

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

A rolling window optimization method for large-scale WCDMA base stations planning problem ⋮ A Benders decomposition algorithm for base station planning problem in WCDMA networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved performance of the greedy algorithm for partial cover
• New trends in discrete and computational geometry
• Almost tight bounds for \(\epsilon\)-nets
• Almost optimal set covers in finite VC-dimension
• A Greedy Heuristic for the Set-Covering Problem
• A Tight Analysis of the Greedy Algorithm for Set Cover
• Reducibility among Combinatorial Problems

This page was built for publication: Combinatorial optimization algorithms for radio network planning