IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v68y2017i2d10.1007_s10589-017-9914-9.html
   My bibliography  Save this article

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

Author

Listed:
  • Adam N. Letchford

    (Lancaster University)

  • Qiang Ni

    (Lancaster University)

  • Zhaoyu Zhong

    (Lancaster University)

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

Suggested Citation

  • Adam N. Letchford & Qiang Ni & Zhaoyu Zhong, 2017. "An exact algorithm for a resource allocation problem in mobile wireless communications," Computational Optimization and Applications, Springer, vol. 68(2), pages 193-208, November.
    • Handle: RePEc:spr:coopap:v:68:y:2017:i:2:d:10.1007_s10589-017-9914-9
    DOI: 10.1007/s10589-017-9914-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-017-9914-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-017-9914-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Antonio Frangioni & Laura Galli & Maria Grazia Scutellà, 2015. "Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 1051-1077, March.
    2. Claudia D’Ambrosio & Andrea Lodi, 2013. "Mixed integer nonlinear programming tools: an updated practical overview," Annals of Operations Research, Springer, vol. 204(1), pages 301-320, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Paraskevopoulos, Dimitris C. & Gürel, Sinan & Bektaş, Tolga, 2016. "The congested multicommodity network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 166-187.
    2. Andrea Lodi & Giulia Zarpellon, 2017. "Rejoinder on: On learning and branching: a survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(2), pages 247-248, July.
    3. Christoph Buchheim & Claudia D’Ambrosio, 2017. "Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization," Journal of Global Optimization, Springer, vol. 67(4), pages 759-786, April.
    4. Kasina, Saamrat & Hobbs, Benjamin F., 2020. "The value of cooperation in interregional transmission planning: A noncooperative equilibrium model approach," European Journal of Operational Research, Elsevier, vol. 285(2), pages 740-752.
    5. Vicente Núñez-Antón & Juan Manuel Pérez-Salamero González & Marta Regúlez-Castillo & Carlos Vidal-Meliá, 2020. "Improving the Representativeness of a Simple Random Sample: An Optimization Model and Its Application to the Continuous Sample of Working Lives," Mathematics, MDPI, vol. 8(8), pages 1-27, July.
    6. Saeed Asadi Bagloee & Majid Sarvi & Avishai Ceder, 2017. "Transit priority lanes in the congested road networks," Public Transport, Springer, vol. 9(3), pages 571-599, October.
    7. Philippe Olivier & Andrea Lodi & Gilles Pesant, 2022. "Measures of balance in combinatorial optimization," 4OR, Springer, vol. 20(3), pages 391-415, September.
    8. Antonio Frangioni & Fabio Furini & Claudio Gentile, 2016. "Approximated perspective relaxations: a project and lift approach," Computational Optimization and Applications, Springer, vol. 63(3), pages 705-735, April.
    9. Marcello D'Amato & Christian Di Pietro & Marco M. Sorge, 2023. "Left and Right: A Tale of Two Tails of the Wealth Distribution," CSEF Working Papers 691, Centre for Studies in Economics and Finance (CSEF), University of Naples, Italy.
    10. Ruth Misener & Christodoulos Floudas, 2014. "ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations," Journal of Global Optimization, Springer, vol. 59(2), pages 503-526, July.
    11. Andreas Lundell & Jan Kronqvist, 2022. "Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT," Journal of Global Optimization, Springer, vol. 82(4), pages 863-896, April.
    12. Mike G. Tsionas & Dionisis Philippas & Constantin Zopounidis, 2023. "Exploring Uncertainty, Sensitivity and Robust Solutions in Mathematical Programming Through Bayesian Analysis," Computational Economics, Springer;Society for Computational Economics, vol. 62(1), pages 205-227, June.
    13. Boukouvala, Fani & Misener, Ruth & Floudas, Christodoulos A., 2016. "Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO," European Journal of Operational Research, Elsevier, vol. 252(3), pages 701-727.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:68:y:2017:i:2:d:10.1007_s10589-017-9914-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.