GUB Covers and Power-Indexed formulations for Wireless Network Design
arXiv:1704.06674 · doi:10.1287/mnsc.1120.1571
Abstract
We propose a pure 0-1 formulation for the wireless network design problem, i.e. the problem of configuring a set of transmitters to provide service coverage to a set of receivers. In contrast with classical mixed integer formulations, where power emissions are represented by continuous variables, we consider only a finite set of powers values. This has two major advantages: it better fits the usual practice and eliminates the sources of numerical problems which heavily affect continuous models. A crucial ingredient of our approach is an effective basic formulation for the single knapsack problem representing the coverage condition of a receiver. This formulation is based on the GUB cover inequalities introduced by Wolsey (1990) and its core is an extension of the exact formulation of the GUB knapsack polytope with two GUB constraints. This special case corresponds to the very common practical situation where only one major interferer is present. We assess the effectiveness of our formulation by comprehensive computational results over realistic instances of two typical technologies, namely WiMAX and DVB-T.
This is the authors' final version of the paper published in Management Science 59(1), 142-156, 2013. DOI: 10.1287/mnsc.1120.1571. The final publication is available at INFORMS via http://pubsonline.informs.org/doi/abs/10.1287/mnsc.1120.1571
Cited by in corpus (7)
- Towards the fast and robust optimal design of Wireless Body Area Networks
- On Improving the Capacity of Solving Large-scale Wireless Network Design Problems by Genetic Algorithms
- Towards an accurate solution of wireless network design problems
- A fast ILP-based Heuristic for the robust design of Body Wireless Sensor Networks
- A hybrid exact-ACO algorithm for the joint scheduling, power and cluster assignment in cooperative wireless networks
- An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design
- Embedding Formulations and Complexity for Unions of Polyhedra