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
Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
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 -