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

DOI10.1002/net.22146MaRDI QIDQ6179723

Unnamed Author, Laura Palagi, Pasquale Avella

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

compact formulationwireless network planning0-1 linear programmingbase station deploymentSINR inequalitiessiting model

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Planning wireless networks by shortest path
• Pure 0-1 programming approaches to wireless network design. (Summary)
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
• Towards an Accurate Solution of Wireless Network Design Problems
• Negative Cycle Separation in Wireless Network Design
• The Network Packing Problem in Terrestrial Broadcasting
• A nested benders decomposition approach for telecommunication network planning
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

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