Papers
Topics
Authors
Recent
Search
2000 character limit reached

GUB Covers and Power-Indexed formulations for Wireless Network Design

Published 21 Apr 2017 in math.OC, cs.DM, cs.DS, and cs.NI | (1704.06674v1)

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.

Citations (55)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.