Home > Research > Publications & Outputs > An exact algorithm for a resource allocation pr...

Electronic data

  • SPARC

    Rights statement: The final publication is available at Springer via http://dx.doi.org/10.1007/s10589-017-9914-9

    Accepted author manuscript, 318 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

An exact algorithm for a resource allocation problem in mobile wireless communications

Research output: Contribution to journalJournal article

Published
<mark>Journal publication date</mark>09/2017
<mark>Journal</mark>Computational Optimization and Applications
Issue number2
Volume68
Number of pages16
Pages (from-to)193-208
Publication statusPublished
Early online date5/05/17
Original languageEnglish

Abstract

We consider a challenging resource allocation problem arising in mobile wireless communications. The goal is to allocate the available channels and power in a so-called OFDMA system, in order to maximise the transmission rate, subject to quality of service (QoS) constraints. Standard MINLP software struggled to solve even small instances of this problem. Using outer approximation, perspective cuts and several implementation "tricks", we are able to solve realistic instances in about one minute. A novel ingredient of our algorithm is what we call pre-emptive cut generation: the generation of cutting planes that are not violated in the current iteration, but are likely to be violated in subsequent iterations.

Bibliographic note

The final publication is available at Springer via http://dx.doi.org/10.1007/s10589-017-9914-9