A rolling window optimization method for large-scale WCDMA base stations planning problem
From MaRDI portal
Publication:2370359
Recommendations
- A Benders decomposition algorithm for base station planning problem in WCDMA networks
- Planning algorithm for WCDMA base station location problem based on cluster decomposition
- Optimal base station positioning and channel assignment for 3G mobile networks by integer programming
- A compact formulation for the base station deployment problem in wireless networks
- A New Sequential Optimization Procedure and Its Applications to Resource Allocation for Wireless Systems
- Optimizing base station location and configuration in UMTS networks
- scientific article; zbMATH DE number 1487909
Cites work
Cited in
(4)- Solving a minimum-power covering problem with overlap constraint for cellular network design
- An efficient two-stage algorithm for decentralized scheduling of micro-CHP units
- Planning algorithm for WCDMA base station location problem based on cluster decomposition
- A Benders decomposition algorithm for base station planning problem in WCDMA networks
This page was built for publication: A rolling window optimization method for large-scale WCDMA base stations planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2370359)