The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Integer programming models for maximizing parallel transmissions in wireless networks

På svenska

Author

  • Yuan Li
  • Michal Pioro

Summary, in English

In radio communications, a set of links that can transmit in parallel with a tolerable interference is called a compatible set. Finding a compatible set with maximum weighted revenue of the parallel transmissions is an important subproblem in wireless network management. For the subproblem, there are two basic approaches to express the signal to interference plus noise ratio (SINR) within integer programming, differing in the number of variables and the quality of the upper bound given by linear relaxations. To our knowledge, there is no systematic study comparing the effectiveness of the two approaches. The contribution of the paper is two-fold. Firstly, we present such a comparison, and, secondly, we introduce matching inequalities improving the upper bounds as compared to the two basic approaches. The matching inequalities are generated within a branch-and-cut algorithm using a minimum odd-cut procedure based on the Gomory-Hu algorithm. The paper presents results of extensive numerical studies illustrating our statements and findings.

Publishing year

2013

Language

English

Pages

197-204

Publication/Series

Electronic Notes in Discrete Mathematics

Volume

41

Document type

Journal article

Publisher

Elsevier

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • branch-and-cut
  • matching polytope
  • Gomory-Hu algorithm
  • SINR

Status

Published

ISBN/ISSN/Other

  • ISSN: 1571-0653