{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T13:20:35Z","timestamp":1783603235279,"version":"3.55.0"},"reference-count":166,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T00:00:00Z","timestamp":1782172800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T00:00:00Z","timestamp":1782172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M20ZBM"],"award-info":[{"award-number":["05M20ZBM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M2025"],"award-info":[{"award-number":["05M2025"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M14ZAM"],"award-info":[{"award-number":["05M14ZAM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M20ZBM"],"award-info":[{"award-number":["05M20ZBM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M2025"],"award-info":[{"award-number":["05M2025"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["A-8000339-01-00"],"award-info":[{"award-number":["A-8000339-01-00"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["A-8000014-00-00"],"award-info":[{"award-number":["A-8000014-00-00"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"United States Department of Defense | United States Navy | Office of Naval Research","doi-asserted-by":"publisher","award":["N000142312585"],"award-info":[{"award-number":["N000142312585"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["23AXE35N"],"award-info":[{"award-number":["23AXE35N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput Sci"],"DOI":"10.1038\/s43588-026-00991-1","type":"journal-article","created":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T09:22:20Z","timestamp":1782206540000},"page":"653-671","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Quantum Optimization Benchmarking Library"],"prefix":"10.1038","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1967-0077","authenticated-orcid":false,"given":"Thorsten","family":"Koch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8308-5016","authenticated-orcid":false,"given":"David E.","family":"Bernal Neira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giorgio","family":"Cortiana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5523-9807","authenticated-orcid":false,"given":"Daniel J.","family":"Egger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raoul","family":"Heese","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Narendra N.","family":"Hegade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alejandro","family":"Gomez Cadavid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4167-1226","authenticated-orcid":false,"given":"Rhea","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Toshinari","family":"Itoko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Kleinert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pedro","family":"Maciel Xavier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naeimeh","family":"Mohseni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8103-4581","authenticated-orcid":false,"given":"Jhon A.","family":"Montanez-Barrera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Koji","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giacomo","family":"Nannicini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7056-7545","authenticated-orcid":false,"given":"Corey","family":"O\u2019Meara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Justin","family":"Pauckert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1083-1133","authenticated-orcid":false,"given":"Manuel","family":"Proissl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anurag","family":"Ramesh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maximilian","family":"Schicker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3307-2221","authenticated-orcid":false,"given":"Noriaki","family":"Shimada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mitsuharu","family":"Takeori","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00edctor","family":"Valls","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1222-4541","authenticated-orcid":false,"given":"David","family":"Van Bulck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5945-4707","authenticated-orcid":false,"given":"Stefan","family":"Woerner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4126-3141","authenticated-orcid":false,"given":"Christa","family":"Zoufal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,23]]},"reference":[{"key":"991_CR1","unstructured":"Abbas A. et al. Challenges and opportunities in quantum optimization. Nat. Rev. Phys. 6, 718\u2013735 (2024)."},{"key":"991_CR2","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M. X. & Williamson, D. P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995).","journal-title":"J. ACM"},{"key":"991_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E. & O\u2019Donnell, R. Optimal inapproximability results for MAX CUT and other 2 variable CSPs?. SIAM J. Comput. 37, 319\u2013357 (2007).","journal-title":"SIAM J. Comput."},{"key":"991_CR4","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1038\/s41586-023-06096-3","volume":"618","author":"Y Kim","year":"2023","unstructured":"Kim, Y. et al. Evidence for the utility of quantum computing before fault tolerance. Nature 618, 500\u2013505 (2023).","journal-title":"Nature"},{"key":"991_CR5","doi-asserted-by":"publisher","unstructured":"Quantum Optimization Benchmarking Library (QOBLIB) zenodo https:\/\/doi.org\/10.5281\/zenodo.18962381 (2026).","DOI":"10.5281\/zenodo.18962381"},{"key":"991_CR6","doi-asserted-by":"crossref","unstructured":"Dongarra, J. J., Moler, C. B., Bunch, J. R. & Stewart, G. W. LINPACK Users\u2019 Guide (SIAM, 1979).","DOI":"10.1137\/1.9781611971811"},{"key":"991_CR7","doi-asserted-by":"crossref","unstructured":"M\u00fcller, M., Whitney, B., Henschel, R. and Kumaran, K. In SPEC Benchmarks 1886\u20131893 (Springer, 2011).","DOI":"10.1007\/978-0-387-09766-4_370"},{"key":"991_CR8","unstructured":"Bartz-Beielstein, T. et al. Benchmarking in Optimization: Best Practice and Open Issues (Technology Arts Sciences, TH K\u00f6ln, 2020)."},{"key":"991_CR9","doi-asserted-by":"publisher","first-page":"100031","DOI":"10.1016\/j.ejco.2022.100031","volume":"10","author":"T Koch","year":"2022","unstructured":"Koch, T. et al. Progress in mathematical programming solvers from 2001 to 2020. EURO J. Comput. Optim. 10, 100031 (2022).","journal-title":"EURO J. Comput. Optim."},{"key":"991_CR10","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1287\/ijoc.2017.0798","volume":"30","author":"I Dunning","year":"2018","unstructured":"Dunning, I., Gupta, S. & Silberholz, J. What works best when? A systematic evaluation of heuristics for Max-Cut and QUBO. INFORMS J. Comput. 30, 608\u2013624 (2018).","journal-title":"INFORMS J. Comput."},{"key":"991_CR11","unstructured":"dimacs2023. DIMACS Implementation Challenges (DIMACS, accessed 3 April 2025); http:\/\/dimacs.rutgers.edu\/programs\/challenge"},{"key":"991_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103572","volume":"301","author":"N Froleyks","year":"2021","unstructured":"Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M. & Suda, M. SAT competition 2020. Artif. Intell. 301, 103572 (2021).","journal-title":"Artif. Intell."},{"key":"991_CR13","unstructured":"The International SAT Competition Web Page https:\/\/satcompetition.github.io (accessed 13 May 2026)."},{"key":"991_CR14","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A. et al. MIPLIB 2017: data-driven compilation of the 6th Mixed-Integer Programming Library. Math. Program. Comput. 13, 443\u2013490 (2021).","journal-title":"Math. Program. Comput."},{"key":"991_CR15","unstructured":"Mittelmann, H. Decision Tree for Optimization Software (Arizona State Univ., accessed 3 April 2025); https:\/\/plato.asu.edu\/bench.html"},{"key":"991_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1038\/s42254-024-00796-z","volume":"7","author":"T Proctor","year":"2025","unstructured":"Proctor, T., Young, K., Baczewski, A. D. & Blume-Kohout, R. Benchmarking quantum computers. Nat. Rev. Phys. 7, 105\u2013118 (2025).","journal-title":"Nat. Rev. Phys."},{"key":"991_CR17","doi-asserted-by":"publisher","first-page":"025004","DOI":"10.1088\/2058-9565\/ae4269","volume":"11","author":"A Acuaviva","year":"2026","unstructured":"Acuaviva, A., Aguirre, D., Pe\u00f1a, R. & Sanz, M. Benchmarking quantum computers: towards a standard performance evaluation approach. Quantum Sci. Technol. 11, 025004 (2026).","journal-title":"Quantum Sci. Technol."},{"key":"991_CR18","unstructured":"Lorenz, J. M. et al. Systematic benchmarking of quantum computers: status and recommendations. Preprint at https:\/\/arxiv.org\/abs\/2503.04905 (2025)."},{"key":"991_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.080505","volume":"109","author":"E Magesan","year":"2012","unstructured":"Magesan, E. et al. Efficient measurement of quantum gate error by interleaved randomized benchmarking. Phys. Rev. Lett. 109, 080505 (2012).","journal-title":"Phys. Rev. Lett."},{"key":"991_CR20","unstructured":"McKay, D. C. et al. Benchmarking quantum processor performance at scale. Preprint at https:\/\/arxiv.org\/abs\/2311.05933 (2023)."},{"key":"991_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1038\/s43588-025-00792-y","volume":"5","author":"PD Nation","year":"2025","unstructured":"Nation, P. D. et al. Benchmarking the performance of quantum computing software. Nat. Comput. Sci. 5, 427\u2013435 (2025).","journal-title":"Nat. Comput. Sci."},{"key":"991_CR22","unstructured":"Wack, A. et al. Quality, speed, and scale: three key attributes to measure the performance of near-term quantum computers. Preprint at https:\/\/arxiv.org\/abs\/2110.14108 (2021)."},{"key":"991_CR23","doi-asserted-by":"publisher","first-page":"043146","DOI":"10.1103\/qt55-7d6r","volume":"7","author":"E Granet","year":"2025","unstructured":"Granet, E. & Dreyer, H. AppQSim: application-oriented benchmarks for Hamiltonian simulation on a quantum computer. Phys. Rev. Research 7, 043146 (2025).","journal-title":"Phys. Rev. Research"},{"key":"991_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2021.3090207","volume":"2","author":"S Martiel","year":"2021","unstructured":"Martiel, S., Ayral, T. & Allouche, C. Benchmarking quantum coprocessors in an application-centric, hardware-agnostic, and scalable way. IEEE Trans. Quantum Eng. 2, 1\u201311 (2021).","journal-title":"IEEE Trans. Quantum Eng."},{"key":"991_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/3678184","volume":"5","author":"T Lubinski","year":"2024","unstructured":"Lubinski, T. et al. Optimization applications as quantum performance benchmarks. ACM Trans. Quantum Comput. 5, 3 (2024).","journal-title":"ACM Trans. Quantum Comput."},{"key":"991_CR26","doi-asserted-by":"crossref","unstructured":"Tomesh, T. et al. SupermarQ: a scalable quantum benchmark suite. In 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA) 587\u2013603 (IEEE, 2022).","DOI":"10.1109\/HPCA53966.2022.00050"},{"key":"991_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.109.012413","volume":"109","author":"GC Santra","year":"2024","unstructured":"Santra, G. C., Jendrzejewski, F., Hauke, P. & Egger, D. J. Squeezing and quantum approximate optimization. Phys. Rev. A 109, 012413 (2024).","journal-title":"Phys. Rev. A"},{"key":"991_CR28","doi-asserted-by":"crossref","unstructured":"Fin\u017egar, J. R., Ross, P., H\u00f6lscher, L., Klepsch, J. & Luckow, A. QUARK: a framework for quantum computing application benchmarking. In 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) 226\u2013237 (IEEE, 2022).","DOI":"10.1109\/QCE53715.2022.00042"},{"key":"991_CR29","unstructured":"McGeoch, C. How not to fool the masses when giving performance results for quantum computers. Preprint at https:\/\/arxiv.org\/abs\/2411.08860 (2024)."},{"key":"991_CR30","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s42484-025-00311-2","volume":"7","author":"DE Bernal Neira","year":"2025","unstructured":"Bernal Neira, D. E. et al. Benchmarking the operation of quantum heuristics and Ising machines: scoring parameter setting strategies on optimization applications. Quantum Mach. Intell. 7, 86 (2025).","journal-title":"Quantum Mach. Intell."},{"key":"991_CR31","unstructured":"Lall, D. et al. A review and collection of metrics and benchmarks for quantum computers: definitions, methodologies and software. Preprint at https:\/\/arxiv.org\/abs\/2502.06717 (2025)."},{"key":"991_CR32","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1126\/science.adg9774","volume":"386","author":"D Wu","year":"2024","unstructured":"Wu, D. et al. Variational benchmarks for quantum many-body problems. Science 386, 296\u2013301 (2024).","journal-title":"Science"},{"key":"991_CR33","doi-asserted-by":"crossref","unstructured":"Karp, R. M. Reducibility among combinatorial problems. In Complexity of Computer Computations: Proc. Symposium on the Complexity of Computer Computations (eds Miller, R. E. et al.) 85\u2013103 (Springer, 1972).","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"991_CR34","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P. K., Van Kreveld, M. & Suri, S. Label placement by maximum independent set in rectangles. Comput. Geom. 11, 209\u2013218 (1998).","journal-title":"Comput. Geom."},{"key":"991_CR35","doi-asserted-by":"publisher","first-page":"1466","DOI":"10.1038\/s41587-020-0584-2","volume":"38","author":"A Hossain","year":"2020","unstructured":"Hossain, A. et al. Automated design of thousands of nonrepetitive parts for engineering stable genetic systems. Nat. Biotechnol. 38, 1466\u20131475 (2020).","journal-title":"Nat. Biotechnol."},{"key":"991_CR36","unstructured":"Wurtz, J. et al. Industry applications of neutral-atom quantum computing solving independent set problems. Preprint at https:\/\/arxiv.org\/abs\/2205.08500 (2022)."},{"key":"991_CR37","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ic.2017.06.001","volume":"255","author":"M Xiao","year":"2017","unstructured":"Xiao, M. & Nagamochi, H. Exact algorithms for maximum independent set. Inf. Comput. 255, 126\u2013146 (2017).","journal-title":"Inf. Comput."},{"key":"991_CR38","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.tcs.2005.03.007","volume":"339","author":"C Bazgan","year":"2005","unstructured":"Bazgan, C., Escoffier, B. & Paschos, V. T. Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Theor. Comput. Sci. 339, 272\u2013292 (2005).","journal-title":"Theor. Comput. Sci."},{"key":"991_CR39","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B. N., Colbourn, C. J. & Johnson, D. S. Unit disk graphs. Discret. Math. 86, 165\u2013177 (1990).","journal-title":"Discret. Math."},{"key":"991_CR40","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1126\/science.abo6587","volume":"376","author":"S Ebadi","year":"2022","unstructured":"Ebadi, S. et al. Quantum optimization of maximum independent set using Rydberg atom arrays. Science 376, 1209\u20131215 (2022).","journal-title":"Science"},{"key":"991_CR41","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"MV Marathe","year":"1995","unstructured":"Marathe, M. V., Breu, H., Hunt, H. B. III, Ravi, S. S. & Rosenkrantz, D. J. Simple heuristics for unit disk graphs. Networks 25, 59\u201368 (1995).","journal-title":"Networks"},{"key":"991_CR42","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.dam.2018.05.049","volume":"280","author":"GK Das","year":"2020","unstructured":"Das, G. K., da Fonseca, G. D. & Jallu, R. K. Efficient independent set approximation in unit disk graphs. Discret. Appl. Math. 280, 63\u201370 (2020).","journal-title":"Discret. Appl. Math."},{"key":"991_CR43","unstructured":"Sloane, N. J. A. Challenge Problems: Independent Sets in Graphs (OEIS Foundation, accessed 25 February 2025); https:\/\/oeis.org\/A265032\/a265032.html"},{"key":"991_CR44","doi-asserted-by":"publisher","unstructured":"Rossi, R., & Ahmed, N. The network data repository with interactive graph analytics and visualization. In Proc. AAAI Conference on Artificial Intelligence, Vol. 29 (2015); https:\/\/doi.org\/10.1609\/aaai.v29i1.9277","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"991_CR45","doi-asserted-by":"crossref","unstructured":"Koch, T., Martin, A. & Vo\u00df, S. SteinLib: an Updated Library on Steiner Tree Problems in Graphs Technical Report ZIB-Report 00-37 (Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, 2000).","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"991_CR46","unstructured":"Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm. Preprint at https:\/\/arxiv.org\/abs\/1411.4028 (2014)."},{"key":"991_CR47","unstructured":"Best practices in quantum optimization. GitHub https:\/\/github.com\/qiskit-community\/qopt-best-practices (2025)."},{"key":"991_CR48","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-06-17-479","volume":"5","author":"DJ Egger","year":"2021","unstructured":"Egger, D. J., Mare\u010dek, J. & Woerner, S. Warm-starting quantum optimization. Quantum 5, 479 (2021).","journal-title":"Quantum"},{"key":"991_CR49","doi-asserted-by":"crossref","unstructured":"Alessandroni, E., Ramos-Calderer, S., Roth, I., Traversi, E. & Aolita, L. Alleviating the quantum Big-M problem. Preprint at https:\/\/arxiv.org\/abs\/2307.10379 (2024).","DOI":"10.1038\/s41534-025-01067-0"},{"key":"991_CR50","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen, P. et al. SciPy 1.0: fundamental algorithms for scientific computing in Python. Nat. Methods 17, 261\u2013272 (2020).","journal-title":"Nat. Methods"},{"key":"991_CR51","unstructured":"IBM Quantum Platform (IBM Quantum, accessed 17 February 2025); https:\/\/quantum.ibm.com"},{"key":"991_CR52","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-12-07-870","volume":"6","author":"J Weidenfeller","year":"2022","unstructured":"Weidenfeller, J. et al. Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware. Quantum 6, 870 (2022).","journal-title":"Quantum"},{"key":"991_CR53","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C. H., Bernstein, E., Brassard, G. & Vazirani, U. Strengths and weaknesses of quantum computing. SIAM J. Comput. 26, 1510\u20131523 (1997).","journal-title":"SIAM J. Comput."},{"key":"991_CR54","unstructured":"de Wolf, R. Quantum computing: lecture notes. Preprint at https:\/\/arxiv.org\/abs\/1907.09415 (2023)."},{"key":"991_CR55","unstructured":"Durr, C. & Hoyer, P. A quantum algorithm for finding the minimum. Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/9607014 (1999)."},{"key":"991_CR56","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-04-08-428","volume":"5","author":"A Gilliam","year":"2021","unstructured":"Gilliam, A., Woerner, S. & Gonciulea, C. Grover adaptive search for constrained polynomial binary optimization. Quantum 5, 428 (2021).","journal-title":"Quantum"},{"key":"991_CR57","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1038\/s41586-025-09527-5","volume":"646","author":"SP Jordan","year":"2025","unstructured":"Jordan, S. P. et al. Optimization by decoded quantum interferometry. Nature 646, 831\u2013836 (2025).","journal-title":"Nature"},{"key":"991_CR58","unstructured":"Schrijver, A. Combinatorial Optimization (Springer, 2003)."},{"key":"991_CR59","unstructured":"Achterberg, T., Koch, T. & Tuchscherer, A. On the Effects of Minor Changes in Model Formulations Technical Report 08-29 (ZIB, 2008)."},{"key":"991_CR60","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A. Ising formulations of many NP problems. Front. Phys. 2, 5 (2014).","journal-title":"Front. Phys."},{"key":"991_CR61","unstructured":"QUBO++ with ABS2 GPU QUBO Solver (Hiroshima University, accessed 31 March 2025); https:\/\/abs2.cs.hiroshima-u.ac.jp\/home"},{"key":"991_CR62","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-024-00825-w","volume":"10","author":"E Pelofske","year":"2024","unstructured":"Pelofske, E., B\u00e4rtschi, A. & Eidenbenz, S. Short-depth QAOA circuits and quantum annealing on higher-order Ising models. npj Quantum Inf. 10, 30 (2024).","journal-title":"npj Quantum Inf."},{"key":"991_CR63","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-016-1032-4","volume":"162","author":"M Anthony","year":"2017","unstructured":"Anthony, M., Boros, E., Crama, Y. & Gruber, A. Quadratic reformulations of nonlinear binary optimization problems. Math. Program. 162, 115\u2013144 (2017).","journal-title":"Math. Program."},{"key":"991_CR64","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10288-019-00424-y","volume":"17","author":"F Glover","year":"2019","unstructured":"Glover, F., Kochenberger, G. & Du, Y. A tutorial on formulating and using QUBO models. 4OR 17, 335\u2013371 (2019).","journal-title":"4OR"},{"key":"991_CR65","doi-asserted-by":"crossref","unstructured":"Xavier, P. M. et al. Disjunctive programming meets QUBO. In Computer Aided Chemical Engineering Vol. 53 (eds Manenti, F. & Reklaitis, G. V.) 3433\u20133438 (Elsevier, 2024).","DOI":"10.1016\/B978-0-443-28824-1.50573-1"},{"key":"991_CR66","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.orl.2013.08.007","volume":"41","author":"T Berthold","year":"2013","unstructured":"Berthold, T. Measuring the impact of primal heuristics. Oper. Res. Lett. 41, 611\u2013614 (2013).","journal-title":"Oper. Res. Lett."},{"key":"991_CR67","unstructured":"Kool, W., van Hoof, H. & Welling, M. Attention, learn to solve routing problems! In International Conference on Learning Representations (ICLR 2019) (2019)."},{"key":"991_CR68","doi-asserted-by":"crossref","unstructured":"Berto, F. et al. RL4CO: an extensive reinforcement learning for combinatorial optimization benchmark. In KDD 2025 \u2014 Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining 5278\u20135289 (ACM, 2025).","DOI":"10.1145\/3711896.3737433"},{"key":"991_CR69","unstructured":"Mandelbaum, R., Corcoles, A. D. & Gambetta, J. IBM\u2019s Big Bet on the Quantum-Centric Supercomputer https:\/\/spectrum.ieee.org\/ibm-quantum-computer-2668978269 (2024)."},{"key":"991_CR70","unstructured":"Javadi-Abhari, A. et al. Quantum computing with Qiskit. Preprint at https:\/\/arxiv.org\/abs\/2405.08810 (2024)."},{"key":"991_CR71","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-024-55346-z","volume":"16","author":"M Sciorilli","year":"2025","unstructured":"Sciorilli, M. et al. Towards large-scale quantum optimization solvers with few qubits. Nat. Commun. 16, 476 (2025).","journal-title":"Nat. Commun."},{"key":"991_CR72","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/ijoc.11.2.205","volume":"11","author":"MD G\u00e9rard Cornu\u00e9jols","year":"1999","unstructured":"G\u00e9rard Cornu\u00e9jols, M. D. Class of hard small 0\u20131 programs. INFORMS J. Comput. 11, 205\u2013210 (1999).","journal-title":"INFORMS J. Comput."},{"key":"991_CR73","unstructured":"Garey, M. R. & Johnson, D. S. Computers and Intractability: a Guide to the Theory of NP-Completeness (Freeman, 1979)."},{"key":"991_CR74","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R Schroeppel","year":"1981","unstructured":"Schroeppel, R. & Shamir, A. A t = O(2n\/2), s = O(2n\/4) algorithm for certain NP-complete problems. SIAM J. Comput. 10, 456\u2013464 (1981).","journal-title":"SIAM J. Comput."},{"key":"991_CR75","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013355015853","volume":"6","author":"A Wassermann","year":"2002","unstructured":"Wassermann, A. Attacking the market split problem with lattice point enumeration. J. Comb. Optim. 6, 5\u201316 (2002).","journal-title":"J. Comb. Optim."},{"key":"991_CR76","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1287\/ijoc.12.3.192.12635","volume":"12","author":"K Aardal","year":"2000","unstructured":"Aardal, K., Bixby, R. E., Hurkens, C. A. J., Lenstra, A. K. & Smeltink, J. W. Market split and basis reduction: towards a solution of the Cornu\u00e9jols\u2013Dawande instances. INFORMS J. Comput. 12, 192\u2013202 (2000).","journal-title":"INFORMS J. Comput."},{"key":"991_CR77","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/TIT.1967.1053969","volume":"13","author":"A Boehmer","year":"1967","unstructured":"Boehmer, A. Binary pulse compression codes. IEEE Trans. Inf. Theory 13, 156\u2013167 (1967).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"991_CR78","doi-asserted-by":"publisher","first-page":"3731","DOI":"10.1088\/0305-4470\/31\/16\/004","volume":"31","author":"S Mertens","year":"1998","unstructured":"Mertens, S. & Bessenrodt, C. On the ground states of the Bernasconi model. J. Phys. A 31, 3731\u20133750 (1998).","journal-title":"J. Phys. A"},{"key":"991_CR79","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10898-020-00972-2","volume":"80","author":"S Elloumi","year":"2021","unstructured":"Elloumi, S., Lambert, A. & Lazare, A. Solving unconstrained 0\u20131 polynomial programs through quadratic convex reformulation. J. Glob. Optim. 80, 231\u2013248 (2021).","journal-title":"J. Glob. Optim."},{"key":"991_CR80","unstructured":"MINLPLib: a Library of Mixed-Integer and Continuous Nonlinear Programming Instances (accessed 3 April 2025); https:\/\/www.minlplib.org\/index.html"},{"key":"991_CR81","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/49\/16\/165001","volume":"49","author":"T Packebusch","year":"2016","unstructured":"Packebusch, T. & Mertens, S. Low autocorrelation binary sequences. J. Phys. A 49, 165001 (2016).","journal-title":"J. Phys. A"},{"key":"991_CR82","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1016\/j.asoc.2009.03.005","volume":"9","author":"JE Gallardo","year":"2009","unstructured":"Gallardo, J. E., Cotta, C. & Fern\u00e1ndez, A. J. Finding low autocorrelation binary sequences with memetic algorithms. Appl. Soft Comput. 9, 1252\u20131262 (2009).","journal-title":"Appl. Soft Comput."},{"key":"991_CR83","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.adm6761","volume":"10","author":"R Shaydulin","year":"2024","unstructured":"Shaydulin, R. et al. Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem. Sci. Adv. 10, eadm6761 (2024).","journal-title":"Sci. Adv."},{"key":"991_CR84","unstructured":"Zhang, Z., Shen, J., Kumar, N. & Pistoia, M. New improvements in solving large LABS instances using massively parallelizable memetic tabu search. Preprint at https:\/\/arxiv.org\/abs\/2504.00987 (2025)."},{"key":"991_CR85","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.laa.2016.02.023","volume":"497","author":"F Dufoss\u00e9","year":"2016","unstructured":"Dufoss\u00e9, F. & U\u00e7ar, B. Notes on Birkhoff\u2013von Neumann decomposition of doubly stochastic matrices. Linear Algebra Its Appl. 497, 108\u2013115 (2016).","journal-title":"Linear Algebra Its Appl."},{"key":"991_CR86","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff, G. Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman A 5, 147\u2013154 (1946).","journal-title":"Univ. Nac. Tucuman A"},{"key":"991_CR87","doi-asserted-by":"publisher","first-page":"191","DOI":"10.4153\/CMB-1982-026-3","volume":"25","author":"RA Brualdi","year":"1982","unstructured":"Brualdi, R. A. Notes on the Birkhoff algorithm for doubly stochastic matrices. Can. Math. Bull. 25, 191\u2013199 (1982).","journal-title":"Can. Math. Bull."},{"key":"991_CR88","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1093\/qmath\/10.1.296","volume":"10","author":"M Marcus","year":"1959","unstructured":"Marcus, M. & Ree, R. Diagonals of doubly stochastic matrices. Q. J. Math. 10, 296\u2013302 (1959).","journal-title":"Q. J. Math."},{"key":"991_CR89","doi-asserted-by":"crossref","unstructured":"Kulkarni, J., Lee, E. & Singh, M. in Integer Programming and Combinatorial Optimization (eds Eisenbrand, F. & Koenemann, J.) 343\u2013354 (Springer, 2017).","DOI":"10.1007\/978-3-319-59250-3_28"},{"key":"991_CR90","doi-asserted-by":"crossref","unstructured":"Chang, C. S., Chen, W. J. & Huang, H. Y. Birkhoff\u2013von Neumann input buffered crossbar switches. In Proc. IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies Vol. 3 1614\u20131623 (IEEE, 2000).","DOI":"10.1109\/INFCOM.2000.832560"},{"key":"991_CR91","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1109\/TNET.2016.2606766","volume":"25","author":"T Ye","year":"2017","unstructured":"Ye, T., Zhang, J., Lee, T. T. & Hu, W. Deflection-compensated Birkhoff\u2013von-Neumann switches. IEEE\/ACM Trans. Netw. 25, 879\u2013895 (2017).","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"991_CR92","doi-asserted-by":"crossref","unstructured":"Liu, H. et al. Scheduling techniques for hybrid circuit\/packet networks. In Proc. 11th ACM Conference on Emerging Networking Experiments and Technologies 41 (Association for Computing Machinery, 2015).","DOI":"10.1145\/2716281.2836126"},{"key":"991_CR93","doi-asserted-by":"crossref","unstructured":"O\u2019Meara, C., Fern\u00e1ndez-Campoamor, M., Cortiana, G. & Bernab\u00e9-Moreno, J. Quantum software architecture blueprints for the Cloud: overview and application to peer-2-peer energy trading. In 2023 IEEE Conference on Technologies for Sustainability (SusTech) 191\u2013198 (IEEE, 2023).","DOI":"10.1109\/SusTech57309.2023.10129617"},{"key":"991_CR94","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s12532-025-00288-w","volume":"17","author":"D Hendrych","year":"2025","unstructured":"Hendrych, D., Troppens, H., Besan\u00e7on, M. & Pokutta, S. Convex mixed-integer optimization with Frank\u2013Wolfe methods. Math. Prog. Comp. 17, 731\u2013757 (2025).","journal-title":"Math. Prog. Comp."},{"key":"991_CR95","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-021-01735-x","volume":"197","author":"CW Combettes","year":"2023","unstructured":"Combettes, C. W. & Pokutta, S. Revisiting the approximate Carath\u00e9odory problem via the Frank\u2013Wolfe algorithm. Math. Program. 197, 191\u2013214 (2023).","journal-title":"Math. Program."},{"key":"991_CR96","doi-asserted-by":"publisher","first-page":"2399","DOI":"10.1109\/TNET.2021.3088327","volume":"29","author":"V Valls","year":"2021","unstructured":"Valls, V., Iosifidis, G. & Tassiulas, L. Birkhoff\u2019s decomposition revisited: sparse scheduling for high-speed circuit switches. IEEE\/ACM Trans. Netw. 29, 2399\u20132412 (2021).","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"991_CR97","unstructured":"Mariella, N. et al. Quantum theory and application of contextual optimal transport. In Proc. 41st International Conference on Machine Learning Vol. 235, 34822\u201334845 (2024)."},{"key":"991_CR98","doi-asserted-by":"crossref","unstructured":"Arora, S. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th Conference on Foundations of Computer Science 2\u201311 (IEEE, 1996).","DOI":"10.1109\/SFCS.1996.548458"},{"key":"991_CR99","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"SL Hakimi","year":"1971","unstructured":"Hakimi, S. L. Steiner\u2019s problem in graphs and its implications. Networks 1, 113\u2013133 (1971).","journal-title":"Networks"},{"key":"991_CR100","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02614374","volume":"78","author":"M Gr\u00f6tschel","year":"1997","unstructured":"Gr\u00f6tschel, M., Martin, A. & Weismantel, R. The Steiner tree packing problem in VLSI design. Math. Program. 78, 265\u2013281 (1997).","journal-title":"Math. Program."},{"key":"991_CR101","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02592085","volume":"72","author":"M Gr\u00f6tschel","year":"1996","unstructured":"Gr\u00f6tschel, M., Martin, A. & Weismantel, R. Packing Steiner trees: polyhedral investigations. Math. Program. 72, 101\u2013123 (1996).","journal-title":"Math. Program."},{"key":"991_CR102","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1137\/S0895480193258716","volume":"9","author":"M Gr\u00f6tschel","year":"1996","unstructured":"Gr\u00f6tschel, M., Martin, A. & Weismantel, R. Packing Steiner trees: separation algorithms. SIAM J. Discret. Math. 9, 233\u2013257 (1996).","journal-title":"SIAM J. Discret. Math."},{"key":"991_CR103","unstructured":"Jain, K., Mahdian, M. & Salavatipour, M. R. Packing Steiner trees. In SODA '03: Proc. Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms Vol. 3 266\u2013274 (Society for Industrial and Applied Mathematics, 2003)."},{"key":"991_CR104","first-page":"112","volume":"63","author":"JE Freund","year":"1956","unstructured":"Freund, J. E. Round robin mathematics. Am. Math. Mon. 63, 112\u2013114 (1956).","journal-title":"Am. Math. Mon."},{"key":"991_CR105","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/jcd.20188","volume":"17","author":"P Kaski","year":"2009","unstructured":"Kaski, P. & \u00d6sterg\u00e5rd, P. R. J. There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K14. J. Comb. Des. 17, 147\u2013159 (2009).","journal-title":"J. Comb. Des."},{"key":"991_CR106","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ejor.2023.02.017","volume":"310","author":"J van Doornmalen","year":"2023","unstructured":"van Doornmalen, J., Hojny, C., Lambers, R. & Spieksma, F. C. R. Integer programming models for round robin tournaments. Eur. J. Oper. Res. 310, 24\u201333 (2023).","journal-title":"Eur. J. Oper. Res."},{"key":"991_CR107","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"GL Nemhauser","year":"1998","unstructured":"Nemhauser, G. L. & Trick, M. A. Scheduling a major college basketball conference. Oper. Res. 46, 1\u20138 (1998).","journal-title":"Oper. Res."},{"key":"991_CR108","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1016\/j.ejor.2022.10.044","volume":"307","author":"D Van Bulck","year":"2023","unstructured":"Van Bulck, D. & Goossens, D. A traditional Benders\u2019 approach to sports timetabling. Eur. J. Oper. Res. 307, 813\u2013826 (2023).","journal-title":"Eur. J. Oper. Res."},{"key":"991_CR109","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.ejor.2022.11.046","volume":"308","author":"D Van Bulck","year":"2023","unstructured":"Van Bulck, D. & Goossens, D. The international timetabling competition on sports timetabling (ITC2021). Eur. J. Oper. Res. 308, 1249\u20131267 (2023).","journal-title":"Eur. J. Oper. Res."},{"key":"991_CR110","doi-asserted-by":"crossref","unstructured":"Van Bulck, D. et al. Which algorithm to select in sports timetabling? Eur. J. Oper. Res. 318, 575\u2013591 (2024).","DOI":"10.1016\/j.ejor.2024.06.005"},{"key":"991_CR111","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H. Portfolio selection. J. Financ. 7, 77\u201391 (1952).","journal-title":"J. Financ."},{"key":"991_CR112","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.ejor.2013.10.060","volume":"234","author":"PN Kolm","year":"2014","unstructured":"Kolm, P. N., T\u00fct\u00fcnc\u00fc, R. & Fabozzi, F. J. 60 years of portfolio optimization: practical challenges and current trends. Eur. J. Oper. Res. 234, 356\u2013371 (2014).","journal-title":"Eur. J. Oper. Res."},{"key":"991_CR113","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1214\/aos\/1176345010","volume":"8","author":"LR Haff","year":"1980","unstructured":"Haff, L. R. Empirical Bayes estimation of the multivariate normal covariance matrix. Ann. Stat. 8, 586\u2013597 (1980).","journal-title":"Ann. Stat."},{"key":"991_CR114","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A. & Nemirovski, A. Robust solutions of uncertain linear programs. Oper. Res. Lett. 25, 1\u201313 (1999).","journal-title":"Oper. Res. Lett."},{"key":"991_CR115","doi-asserted-by":"publisher","first-page":"28","DOI":"10.2469\/faj.v48.n5.28","volume":"48","author":"F Black","year":"1992","unstructured":"Black, F. & Litterman, R. Global portfolio optimization. Financ. Anal. J. 48, 28\u201343 (1992).","journal-title":"Financ. Anal. J."},{"key":"991_CR116","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1093\/rfs\/14.3.901","volume":"14","author":"RO Michaud","year":"2015","unstructured":"Michaud, R. O. & Ma, T. Efficient asset management: a practical guide to stock portfolio optimization and asset allocation. Rev. Financ. Stud. 14, 901\u2013904 (2015).","journal-title":"Rev. Financ. Stud."},{"key":"991_CR117","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2307\/1926560","volume":"51","author":"RC Merton","year":"1969","unstructured":"Merton, R. C. Lifetime portfolio selection under uncertainty: the continuous-time case. Rev. Econ. Stat. 51, 247\u2013257 (1969).","journal-title":"Rev. Econ. Stat."},{"key":"991_CR118","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1093\/rfs\/hhm075","volume":"22","author":"V DeMiguel","year":"2007","unstructured":"DeMiguel, V., Garlappi, L. & Uppal, R. Optimal versus naive diversification: how inefficient is the 1\/n portfolio strategy?. Rev. Financ. Stud. 22, 1915\u20131953 (2007).","journal-title":"Rev. Financ. Stud."},{"key":"991_CR119","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3905\/jpm.2016.42.4.059","volume":"42","author":"M L\u00f3pez de Prado","year":"2016","unstructured":"L\u00f3pez de Prado, M. Building diversified portfolios that outperform out of sample. J. Portf. Manag. 42, 59\u201369 (2016).","journal-title":"J. Portf. Manag."},{"key":"991_CR120","doi-asserted-by":"publisher","DOI":"10.3390\/e24111631","volume":"24","author":"J Gava","year":"2022","unstructured":"Gava, J. & Turc, J. The properties of alpha risk parity portfolios. Entropy 24, 1631 (2022).","journal-title":"Entropy"},{"key":"991_CR121","doi-asserted-by":"publisher","first-page":"5","DOI":"10.21314\/JOR.2001.041","volume":"3","author":"R Almgren","year":"2000","unstructured":"Almgren, R. & Chriss, N. Optimal execution of portfolio transactions. J. Risk 3, 5\u201339 (2000).","journal-title":"J. Risk"},{"key":"991_CR122","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.ejor.2014.12.040","volume":"243","author":"J Palczewski","year":"2015","unstructured":"Palczewski, J., Poulsen, R., Schenk-Hopp\u00e9, K. R. & Wang, H. Dynamic portfolio optimization with transaction costs and state-dependent drift. Eur. J. Oper. Res. 243, 921\u2013931 (2015).","journal-title":"Eur. J. Oper. Res."},{"key":"991_CR123","doi-asserted-by":"crossref","unstructured":"Kolm, P. N. and Ritter, G. Modern perspectives on reinforcement learning in finance. SSRN Electron. J. (2019).","DOI":"10.2139\/ssrn.3449401"},{"key":"991_CR124","doi-asserted-by":"publisher","first-page":"1752","DOI":"10.1287\/mnsc.1110.1377","volume":"57","author":"DB Brown","year":"2011","unstructured":"Brown, D. B. & Smith, J. E. Dynamic portfolio optimization with transaction costs: heuristics and dual bounds. Manag. Sci. 57, 1752\u20131770 (2011).","journal-title":"Manag. Sci."},{"key":"991_CR125","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1287\/mnsc.25.11.1127","volume":"25","author":"GM Constantinides","year":"1979","unstructured":"Constantinides, G. M. Multiperiod consumption and investment behavior with convex transactions costs. Manag. Sci. 25, 1127\u20131137 (1979).","journal-title":"Manag. Sci."},{"key":"991_CR126","doi-asserted-by":"crossref","unstructured":"Kerenidis, I., Prakash, A. & Szil\u00e1gyi, D. Quantum algorithms for portfolio optimization. In Proc. 1st ACM Conference on Advances in Financial Technologies 147\u2013155 (Association for Computing Machinery, 2019).","DOI":"10.1145\/3318041.3355465"},{"key":"991_CR127","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1109\/JSTSP.2016.2574703","volume":"10","author":"G Rosenberg","year":"2016","unstructured":"Rosenberg, G. et al. Solving the optimal trading trajectory problem using a quantum annealer. IEEE J. Sel. Top. Signal Process. 10, 1053\u20131060 (2016).","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"991_CR128","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-024-04256-6","volume":"23","author":"D Lim","year":"2024","unstructured":"Lim, D. & Rebentrost, P. A quantum online portfolio optimization algorithm. Quantum Inf. Process. 23, 63 (2024).","journal-title":"Quantum Inf. Process."},{"key":"991_CR129","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-022-03766-5","volume":"22","author":"S Brandhofer","year":"2022","unstructured":"Brandhofer, S. et al. Benchmarking the performance of portfolio optimization with QAOA. Quantum Inf. Process. 22, 25 (2022).","journal-title":"Quantum Inf. Process."},{"key":"991_CR130","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-07-28-513","volume":"5","author":"N Slate","year":"2021","unstructured":"Slate, N., Matwiejew, E., Marsh, S. & Wang, J. B. Quantum walk-based portfolio optimisation. Quantum 5, 513 (2021).","journal-title":"Quantum"},{"key":"991_CR131","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.013006","volume":"4","author":"S Mugel","year":"2022","unstructured":"Mugel, S. et al. Dynamic portfolio optimization with real datasets using quantum processors and quantum-inspired tensor networks. Phys. Rev. Res. 4, 013006 (2022).","journal-title":"Phys. Rev. Res."},{"key":"991_CR132","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02592208","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D. Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74, 121\u2013140 (1996).","journal-title":"Math. Program."},{"key":"991_CR133","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B Gavish","year":"1991","unstructured":"Gavish, B. Topological design of telecommunication networks\u2014local access design methods. Ann. Oper. Res. 33, 17\u201371 (1991).","journal-title":"Ann. Oper. Res."},{"key":"991_CR134","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"TL Magnanti","year":"1984","unstructured":"Magnanti, T. L. & Wong, R. T. Network design and transportation planning: models and algorithms. Transp. Sci. 18, 1\u201355 (1984).","journal-title":"Transp. Sci."},{"key":"991_CR135","doi-asserted-by":"publisher","first-page":"4701","DOI":"10.1049\/gtd2.12751","volume":"17","author":"R Saberi","year":"2023","unstructured":"Saberi, R. et al. Power distribution network expansion planning to improve resilience. IET Gener. Transm. Distrib. 17, 4701\u20134716 (2023).","journal-title":"IET Gener. Transm. Distrib."},{"key":"991_CR136","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01585766","volume":"68","author":"D Bienstock","year":"1995","unstructured":"Bienstock, D. & G\u00fcnl\u00fck, O. Computational experience with a difficult mixedinteger multicommodity flow problem. Math. Program. 68, 213\u2013237 (1995).","journal-title":"Math. Program."},{"key":"991_CR137","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01581104","volume":"81","author":"D Bienstock","year":"1998","unstructured":"Bienstock, D., Chopra, S., G\u00fcnl\u00fck, O. & Tsai, C.-Y. Minimum cost capacity installation for multicommodity network flows. Math. Program. 81, 177\u2013199 (1998).","journal-title":"Math. Program."},{"key":"991_CR138","doi-asserted-by":"crossref","unstructured":"Gendron, B., Crainic, T. G. & Frangioni, A. in Telecommunications Network Planning (eds Sans\u00f2, B. & Soriano, P.) 1\u201319 (Springer, 1999).","DOI":"10.1007\/978-1-4615-5087-7_1"},{"key":"991_CR139","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.36.1.1.571","volume":"36","author":"AP Armacost","year":"2002","unstructured":"Armacost, A. P., Barnhart, C. & Ware, K. A. Composite variable formulations for express shipment service network design. Transp. Sci. 36, 1\u201320 (2002).","journal-title":"Transp. Sci."},{"key":"991_CR140","doi-asserted-by":"crossref","unstructured":"Magnanti, T. L., Mireault, P. & Wong, R. T. Tailoring Benders Decomposition for Uncapacitated Network Design (Springer, 1986).","DOI":"10.1007\/BFb0121090"},{"key":"991_CR141","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1287\/opre.44.6.852","volume":"44","author":"C Barnhart","year":"1996","unstructured":"Barnhart, C. & Schneur, R. R. Air network design for express shipment service. Oper. Res. 44, 852\u2013863 (1996).","journal-title":"Oper. Res."},{"key":"991_CR142","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G. B. & Ramser, J. H. The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959).","journal-title":"Manag. Sci."},{"key":"991_CR143","unstructured":"Helsgaun, K. An Extension of the Lin\u2013Kernighan\u2013Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems Technical Report (Roskilde Univ., 2017)."},{"key":"991_CR144","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-024-04497-5","volume":"23","author":"N Xie","year":"2024","unstructured":"Xie, N. et al. A feasibility-preserved quantum approximate solver for the capacitated vehicle routing problem. Quantum Inf. Process. 23, 291 (2024).","journal-title":"Quantum Inf. Process."},{"key":"991_CR145","doi-asserted-by":"crossref","unstructured":"Mohanty, N., Behera, B. K. & Ferrie, C. Analysis of the vehicle routing problem solved via hybrid quantum algorithms in the presence of noisy channels. IEEE Trans. Quantum Eng. 4 (2023).","DOI":"10.1109\/TQE.2023.3303989"},{"key":"991_CR146","doi-asserted-by":"publisher","first-page":"2300309","DOI":"10.1002\/qute.202300309","volume":"7","author":"ID Leonidas","year":"2024","unstructured":"Leonidas, I. D. et al. Qubit efficient quantum algorithms for the vehicle routing problem on noisy intermediate-scale quantum processors. Adv. Quantum Technol. 7, 2300309 (2024).","journal-title":"Adv. Quantum Technol."},{"key":"991_CR147","doi-asserted-by":"publisher","first-page":"25415","DOI":"10.1038\/s41598-024-76967-w","volume":"14","author":"D Fitzek","year":"2021","unstructured":"Fitzek, D., Ghandriz, T., Laine, L., Granath, M. & Kockum, A. F. Applying quantum approximate optimization to the heterogeneous vehicle routing problem. Sci. Rep. 14, 25415 (2021).","journal-title":"Sci. Rep."},{"key":"991_CR148","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W. & Zemlin, R. A. Integer programming formulation of traveling salesman problems. J. ACM 7, 326\u2013329 (1960).","journal-title":"J. ACM"},{"key":"991_CR149","unstructured":"Sidorov, K. & Morozov, A. A review of approaches to modeling applied vehicle routing problems. Preprint at https:\/\/arxiv.org\/abs\/2105.10950 (2021)."},{"key":"991_CR150","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G. & Wright, J. W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568\u2013581 (1964).","journal-title":"Oper. Res."},{"key":"991_CR151","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.procs.2024.03.032","volume":"234","author":"D Muriyatmoko","year":"2024","unstructured":"Muriyatmoko, D., Djunaidy, A. & Muklason, A. Heuristics and metaheuristics for solving capacitated vehicle routing problem: an algorithm comparison. Procedia Comput. Sci. 234, 494\u2013501 (2024).","journal-title":"Procedia Comput. Sci."},{"key":"991_CR152","doi-asserted-by":"crossref","unstructured":"El Jaouhari, M., Bencheikh, G. & Bencheikh, G. Exploring the capacitated vehicle routing problem using the power of machine learning: a literature review. In Proc. 7th International Conference on Logistics Operations Management, GOL\u201924 (eds Benadada, Y. et al.) 68\u201380 (Springer Nature, 2024).","DOI":"10.1007\/978-3-031-68634-4_7"},{"key":"991_CR153","unstructured":"Harikrishnakumar, R., Nannapaneni, S., Nguyen, N. H., Steck, J. E. & Behrman, E. C. A quantum annealing approach for dynamic multi-depot capacitated vehicle routing problem. Preprint at https:\/\/arxiv.org\/abs\/2005.12478 (2020)."},{"key":"991_CR154","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-003-0440-4","volume":"97","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V. & Cook, W. Implementing the Dantzig\u2013Fulkerson\u2013Johnson algorithm for large traveling salesman problems. Math. Program. 97, 91\u2013153 (2003).","journal-title":"Math. Program."},{"key":"991_CR155","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra, J. K. & Kan, A. H. G. R. Complexity of vehicle routing and scheduling problems. Networks 11, 221\u2013227 (1981).","journal-title":"Networks"},{"key":"991_CR156","unstructured":"Munari, P., Dollevoet, T. & Spliet, R. A generalized formulation for vehicle routing problems. Preprint at https:\/\/arxiv.org\/abs\/1606.01935 (2017)."},{"key":"991_CR157","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1147\/rd.45.0497","volume":"4","author":"AJ Hoffman","year":"1960","unstructured":"Hoffman, A. J. & Singleton, R. R. On Moore graphs with diameters 2 and 3. IBM J. Res. Dev. 4, 497\u2013504 (1960).","journal-title":"IBM J. Res. Dev."},{"key":"991_CR158","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/net.3230040405","volume":"4","author":"VG Cerf","year":"1974","unstructured":"Cerf, V. G., Cowan, D. D., Mullin, R. C. & Stanton, R. G. A lower bound on the average shortest path length in regular graphs. Networks 4, 335\u2013342 (1974).","journal-title":"Networks"},{"key":"991_CR159","doi-asserted-by":"crossref","unstructured":"Shin, J. Y., Wong, B. & Sirer, E. G. Small-world datacenters. In Proc. 2nd ACM Symposium on Cloud Computing 2 (Association for Computing Machinery, 2011).","DOI":"10.1145\/2038916.2038918"},{"key":"991_CR160","doi-asserted-by":"crossref","unstructured":"Besta M. & Hoefler, T. Slim Fly: a cost effective low-diameter network topology. In SC\u201914: Proc. International Conference for High Performance Computing, Networking, Storage and Analysis 348\u2013359 (IEEE, 2014).","DOI":"10.1109\/SC.2014.34"},{"key":"991_CR161","unstructured":"Singla, A., Hong, C. Y., Popa, L. & Godfrey, P. B. Jellyfish: networking data centers randomly. In 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12) 225\u2013238 (USENIX Association, 2012)."},{"key":"991_CR162","unstructured":"Koibuchi, M. et al. Graph Golf: the Order\/Degree Problem Competition, 2015 (accessed 16 September 2024); https:\/\/research.nii.ac.jp\/graphgolf\/"},{"key":"991_CR163","unstructured":"Waniek, R. Graph Golf: Betrachtung des Order-Degree-Problems. Master\u2019s thesis, Technische Univ. Berlin (2021)."},{"key":"991_CR164","unstructured":"QAOA Bench. Independent set benchmarking. GitHub https:\/\/github.com\/eggerdj\/independent_set_benchmarking (2025)."},{"key":"991_CR165","unstructured":"QiskitOpt. Qiskit Ecosystem: Qiskit Optimization. GitHub https:\/\/github.com\/qiskit-community\/qiskit-optimization (2025)."},{"key":"991_CR166","unstructured":"Koch, T. Rapid Mathematical Programming. PhD thesis, Technische Univ. Berlin, ZIB-Report 04-58 (2004)."}],"container-title":["Nature Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s43588-026-00991-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-026-00991-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-026-00991-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T13:02:54Z","timestamp":1783602174000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s43588-026-00991-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,23]]},"references-count":166,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["991"],"URL":"https:\/\/doi.org\/10.1038\/s43588-026-00991-1","relation":{},"ISSN":["2662-8457"],"issn-type":[{"value":"2662-8457","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,23]]},"assertion":[{"value":"28 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}