This article considers the base station deployment problem in a wireless network. The natural formulation of this problem usually leads to numerical and memory issues, preventing users from dealing with real-world cases. We provide a compact reformulation that allows us to get beyond the drawbacks of the natural formulation. Tests are done on ten instances derived from realistic LTE scenarios. The computational results show that the proposed reformulation enables mixed-integer programming solvers to provide an optimal solution in a short amount of time.
A compact formulation for the base station deployment problem in wireless networks / Avella, Pasquale; Calamita, Alice; Palagi, Laura. - In: NETWORKS. - ISSN 1097-0037. - 82:1(2023), pp. 52-67. [10.1002/net.22146]
A compact formulation for the base station deployment problem in wireless networks
Alice Calamita
;Laura Palagi
2023
Abstract
This article considers the base station deployment problem in a wireless network. The natural formulation of this problem usually leads to numerical and memory issues, preventing users from dealing with real-world cases. We provide a compact reformulation that allows us to get beyond the drawbacks of the natural formulation. Tests are done on ten instances derived from realistic LTE scenarios. The computational results show that the proposed reformulation enables mixed-integer programming solvers to provide an optimal solution in a short amount of time.| File | Dimensione | Formato | |
|---|---|---|---|
|
Avella_A-compact_2023.pdf
accesso aperto
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Creative commons
Dimensione
5.54 MB
Formato
Adobe PDF
|
5.54 MB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
