Combinatorial optimization algorithms for radio network planning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1256748 (Why is no real title available?)
- scientific article; zbMATH DE number 1559541 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A Tight Analysis of the Greedy Algorithm for Set Cover
- Almost optimal set covers in finite VC-dimension
- Almost tight bounds for -nets
- Improved performance of the greedy algorithm for partial cover
- New trends in discrete and computational geometry
- Reducibility among combinatorial problems
Cited in
(6)- A Benders decomposition algorithm for base station planning problem in WCDMA networks
- scientific article; zbMATH DE number 2040676 (Why is no real title available?)
- Local search algorithms for the radio link frequency assignment problem
- Optimal Placement of Antennae Using Metaheuristics
- A rolling window optimization method for large-scale WCDMA base stations planning problem
- scientific article; zbMATH DE number 5014521 (Why is no real title available?)
This page was built for publication: Combinatorial optimization algorithms for radio network planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941516)