A compact formulation for the base station deployment problem in wireless networks

DOI10.1002/NET.22146MaRDI QIDQ6179723zbMATH OpenFDO

Authors Pasquale Avella, L. Palagi

Publication date 18 December 2023

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/NET.22146

zbMATH Keywords

0-1 linear programmingbase station deploymentcompact formulationSINR inequalitiessiting modelwireless network planning

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A nested Benders decomposition approach for telecommunication network planning
• Negative cycle separation in wireless network design
• Planning wireless networks by shortest path
• Pure 0-1 programming approaches to wireless network design. (Summary)
• Scikit-learn: machine learning in Python
• The Network Packing Problem in Terrestrial Broadcasting
• Towards an accurate solution of wireless network design problems
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints

Cited in

(4)

• A rolling window optimization method for large-scale WCDMA base stations planning problem
• Minimizing costs in signal provision by communication antennas along a railway line
• Speeding up the solution of the site and power assignment problem in wireless networks
• Benders decomposition for congested partial set covering location with uncertain demand

This page was built for publication: A compact formulation for the base station deployment problem in wireless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179723)