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

Research

Associated organisational units

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:

Keywords

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

An exact algorithm for a resource allocation problem in mobile wireless communications. / Letchford, Adam Nicholas; Ni, Qiang; Zhong, Zhaoyu.
In: Computational Optimization and Applications, Vol. 68, No. 2, 09.2017, p. 193-208.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Letchford, AN, Ni, Q & Zhong, Z 2017, 'An exact algorithm for a resource allocation problem in mobile wireless communications', Computational Optimization and Applications, vol. 68, no. 2, pp. 193-208. https://doi.org/10.1007/s10589-017-9914-9

APA

Letchford, A. N., Ni, Q., & Zhong, Z. (2017). An exact algorithm for a resource allocation problem in mobile wireless communications. Computational Optimization and Applications, 68(2), 193-208. https://doi.org/10.1007/s10589-017-9914-9

Vancouver

Letchford AN, Ni Q, Zhong Z. An exact algorithm for a resource allocation problem in mobile wireless communications. Computational Optimization and Applications. 2017 Sept;68(2):193-208. Epub 2017 May 5. doi: 10.1007/s10589-017-9914-9

Author

Letchford, Adam Nicholas ; Ni, Qiang ; Zhong, Zhaoyu. / An exact algorithm for a resource allocation problem in mobile wireless communications. In: Computational Optimization and Applications. 2017 ; Vol. 68, No. 2. pp. 193-208.

Bibtex

@article{864c237094c9460fa37e9fd8d24e75a2,
title = "An exact algorithm for a resource allocation problem in mobile wireless communications",
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.",
keywords = "mixed-integer nonlinear programming, mobile wireless communications",
author = "Letchford, {Adam Nicholas} and Qiang Ni and Zhaoyu Zhong",
note = "The final publication is available at Springer via http://dx.doi.org/10.1007/s10589-017-9914-9",
year = "2017",
month = sep,
doi = "10.1007/s10589-017-9914-9",
language = "English",
volume = "68",
pages = "193--208",
journal = "Computational Optimization and Applications",
issn = "0926-6003",
publisher = "Springer Netherlands",
number = "2",

}

RIS

TY - JOUR

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

AU - Letchford, Adam Nicholas

AU - Ni, Qiang

AU - Zhong, Zhaoyu

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

PY - 2017/9

Y1 - 2017/9

N2 - 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.

AB - 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.

KW - mixed-integer nonlinear programming

KW - mobile wireless communications

U2 - 10.1007/s10589-017-9914-9

DO - 10.1007/s10589-017-9914-9

M3 - Journal article

VL - 68

SP - 193

EP - 208

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

SN - 0926-6003

IS - 2

ER -