IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v320y2025i3p516-526.html
   My bibliography  Save this article

Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems

Author

Listed:
  • Grange, Camille
  • Poss, Michael
  • Bourreau, Eric
  • T’kindt, Vincent
  • Ploton, Olivier

Abstract

Grover Search is currently one of the main quantum algorithms leading to hybrid quantum–classical methods that reduce the worst-case time complexity for some combinatorial optimization problems. Specifically, the combination of Quantum Minimum Finding (obtained from Grover Search) with dynamic programming has proved particularly efficient in improving the complexity of NP-hard problems currently solved by classical dynamic programming. For these problems, the classical dynamic programming complexity in O∗(cn), where O∗ denotes that polynomial factors are ignored, can be reduced by a hybrid algorithm to O∗(cquantn), with cquant

Suggested Citation

  • Grange, Camille & Poss, Michael & Bourreau, Eric & T’kindt, Vincent & Ploton, Olivier, 2025. "Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems," European Journal of Operational Research, Elsevier, vol. 320(3), pages 516-526.
  • Handle: RePEc:eee:ejores:v:320:y:2025:i:3:p:516-526
    DOI: 10.1016/j.ejor.2024.09.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724006969
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.09.005?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. Lei Shang & Christophe Lenté & Mathieu Liedloff & Vincent T’Kindt, 2018. "Exact exponential algorithms for 3-machine flowshop scheduling problems," Journal of Scheduling, Springer, vol. 21(2), pages 227-233, April.
    2. Olivier Ploton & Vincent T’kindt, 2023. "Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion," Journal of Scheduling, Springer, vol. 26(2), pages 137-145, April.
    3. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2022. "Moderate exponential-time algorithms for scheduling problems," 4OR, Springer, vol. 20(4), pages 533-566, December.
    4. Olivier Ploton & Vincent T’kindt, 2022. "Exponential-time algorithms for parallel machine scheduling problems," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3405-3418, December.
    5. Camille Grange & Michael Poss & Eric Bourreau, 2023. "An introduction to variational quantum algorithms for combinatorial optimization problems," 4OR, Springer, vol. 21(3), pages 363-403, September.
    6. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    7. Samson Wang & Enrico Fontana & M. Cerezo & Kunal Sharma & Akira Sone & Lukasz Cincio & Patrick J. Coles, 2021. "Noise-induced barren plateaus in variational quantum algorithms," Nature Communications, Nature, vol. 12(1), pages 1-11, December.
    8. Kurowski, Krzysztof & Pecyna, Tomasz & Slysz, Mateusz & Różycki, Rafał & Waligóra, Grzegorz & Wȩglarz, Jan, 2023. "Application of quantum approximate optimization algorithm to job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 518-528.
    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. Camille Grange & Michael Poss & Eric Bourreau, 2024. "An introduction to variational quantum algorithms for combinatorial optimization problems," Annals of Operations Research, Springer, vol. 343(2), pages 847-884, December.
    2. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2024. "Moderate exponential-time algorithms for scheduling problems," Annals of Operations Research, Springer, vol. 343(2), pages 753-783, December.
    3. Yves Crama & Michel Grabisch & Silvano Martello, 2024. "Still more surveys in operations research…," Annals of Operations Research, Springer, vol. 343(2), pages 559-571, December.
    4. Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer, 2015. "Approximation Limits of Linear Programs (Beyond Hierarchies)," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 756-772, March.
    5. Yanling Chu & Xiaoju Zhang & Zhongzhen Yang, 2017. "Multiple quay cranes scheduling for double cycling in container terminals," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-19, July.
    6. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    7. Cécile Bastidon & Michael Bordo & Antoine Parent & Marc Daniel Weidenmier, 2023. "Another history of global financial markets: Local stock market integration since 1913 from a network perspective," The World Economy, Wiley Blackwell, vol. 46(8), pages 2456-2477, August.
    8. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    9. Huang, Fangyu & Tan, Xiaoqing & Huang, Rui & Xu, Qingshan, 2022. "Variational convolutional neural networks classifiers," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).
    10. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2022. "Moderate exponential-time algorithms for scheduling problems," 4OR, Springer, vol. 20(4), pages 533-566, December.
    11. Schuijbroek, J. & Hampshire, R.C. & van Hoeve, W.-J., 2017. "Inventory rebalancing and vehicle routing in bike sharing systems," European Journal of Operational Research, Elsevier, vol. 257(3), pages 992-1004.
    12. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    13. de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)," Discussion Paper 2007-101, Tilburg University, Center for Economic Research.
    14. Marco Antonio Boschetti & Vittorio Maniezzo, 2024. "Contemporary approaches in matheuristics an updated survey," Annals of Operations Research, Springer, vol. 343(2), pages 663-700, December.
    15. Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    16. G. Rius-Sorolla & J. Maheut & Jairo R. Coronado-Hernandez & J. P. Garcia-Sabater, 2020. "Lagrangian relaxation of the generic materials and operations planning model," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 105-123, March.
    17. Ghosh, Diptesh & Sumanta Basu, 2011. "Diversified Local Search for the Traveling Salesman Problem," IIMA Working Papers WP2011-01-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    18. Kouhei Harada, 2021. "A Feasibility-Ensured Lagrangian Heuristic for General Decomposable Problems," SN Operations Research Forum, Springer, vol. 2(4), pages 1-26, December.
    19. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    20. Horbach, Andrei, 2005. "Combinatorial relaxation of the k-traveling salesman problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 599, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:eee:ejores:v:320:y:2025:i:3:p:516-526. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.