IDEAS home Printed from https://ideas.repec.org/a/pal/jorapm/v24y2025i6d10.1057_s41272-025-00527-8.html
   My bibliography  Save this article

Application of quantum computing in choice-based network revenue management

Author

Listed:
  • Mogens Dalgaard

    (Kvantify)

  • Antoine Boulanger

    (Amadeus IT Group)

  • Alexander Papen

    (Amadeus IT Group)

  • Rune T. Hansen

    (Kvantify)

  • Thomas Fiig

    (Amadeus IT Group)

  • Janus Wesenberg

    (Kvantify)

Abstract

This paper explores the potential of quantum computing for solving the choice-based deterministic linear program (CDLP) for network revenue management. The CDLP is a model that incorporates customer choice between parallel itineraries serving the same origin–destination market and has been shown to offer significant revenue benefits compared to traditional methods. However, the CDLP is computationally intractable for realistic network sizes due to the exponential growth of the offer set space. We propose a novel quantum algorithm that uses quantum column generation and quantum search to achieve a quadratic speed-up over the classical counterparts. We demonstrate the feasibility and performance of our quantum algorithm on a toy network example and discuss the implications and challenges for future applications. Our work stands as the first of its kind to apply quantum computing to the domain of airline revenue management.

Suggested Citation

  • Mogens Dalgaard & Antoine Boulanger & Alexander Papen & Rune T. Hansen & Thomas Fiig & Janus Wesenberg, 2025. "Application of quantum computing in choice-based network revenue management," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 24(6), pages 506-523, December.
  • Handle: RePEc:pal:jorapm:v:24:y:2025:i:6:d:10.1057_s41272-025-00527-8
    DOI: 10.1057/s41272-025-00527-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/s41272-025-00527-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1057/s41272-025-00527-8?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:pal:jorapm:v:24:y:2025:i:6:d:10.1057_s41272-025-00527-8. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.palgrave.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.