{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T22:14:39Z","timestamp":1778710479177,"version":"3.51.4"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100021130","name":"Bundesministerium f\u00fcr Wirtschaft und Klimaschutz","doi-asserted-by":"publisher","award":["01MK20005"],"award-info":[{"award-number":["01MK20005"]}],"id":[{"id":"10.13039\/100021130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003495","name":"Hessisches Ministerium f\u00fcr Wissenschaft und Kunst","doi-asserted-by":"publisher","award":["1362\/22-67"],"award-info":[{"award-number":["1362\/22-67"]}],"id":[{"id":"10.13039\/501100003495","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10444-026-10292-w","type":"journal-article","created":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T10:45:39Z","timestamp":1771843539000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Curve fitting on a quantum annealer for an advanced navigation method"],"prefix":"10.1007","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1989-0886","authenticated-orcid":false,"given":"Philipp","family":"Isserstedt","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Jaroszewski","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Mergenthaler","sequence":"additional","affiliation":[]},{"given":"Felix","family":"Paul","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8666-7791","authenticated-orcid":false,"given":"Bastian","family":"Harrach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"key":"10292_CR1","volume-title":"Just in time arrival guide-barriers and potential solutions","author":"GEF-UNDP-IMO GloMEEP Project and members of the GIA","year":"2020","unstructured":"GEF-UNDP-IMO GloMEEP Project and members of the GIA: Just in time arrival guide-barriers and potential solutions. GloMEEP Project Coordination Unit, International Maritime Organization, London (2020)"},{"key":"10292_CR2","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1073\/pnas.38.8.716","volume":"38","author":"R Bellman","year":"1952","unstructured":"Bellman, R.: On the theory of dynamic programming. Proc. Natl. Acad. Sci. U.S.A. 38, 716 (1952). https:\/\/doi.org\/10.1073\/pnas.38.8.716","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"10292_CR3","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1073\/pnas.39.10.1077","volume":"39","author":"R Bellman","year":"1953","unstructured":"Bellman, R.: Some functional equations in the theory of dynamic programming. Proc. Natl. Acad. Sci. U.S.A. 39, 1077 (1953). https:\/\/doi.org\/10.1073\/pnas.39.10.1077","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"10292_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1073\/pnas.40.4.231","volume":"40","author":"R Bellman","year":"1954","unstructured":"Bellman, R.: Dynamic programming and a new formalism in the calculus of variations. Proc. Natl. Acad. Sci. U.S.A. 40, 231 (1954). https:\/\/doi.org\/10.1073\/pnas.40.4.231","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"10292_CR5","volume-title":"Dynamic programming","author":"R Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic programming. Princeton University Press, Princeton (1957)"},{"key":"10292_CR6","volume-title":"Operations research","author":"K Neumann","year":"2002","unstructured":"Neumann, K., Morlock, M.: Operations research, 2nd edn. Hanser, Munich, Vienna (2002)","edition":"2"},{"key":"10292_CR7","volume-title":"Dynamic programming and optimal control-volume I","author":"DP Bertsekas","year":"2017","unstructured":"Bertsekas, D.P.: Dynamic programming and optimal control-volume I, 4th edn. Athena Scientific, Belmont (2017)","edition":"4"},{"key":"10292_CR8","volume-title":"Dynamic programming and optimal control-volume II","author":"DP Bertsekas","year":"2012","unstructured":"Bertsekas, D.P.: Dynamic programming and optimal control-volume II, 4th edn. Athena Scientific, Belmont (2012)","edition":"4"},{"key":"10292_CR9","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement learning: an introduction, 2nd edn. MIT Press, Cambridge, London (2018)","edition":"2"},{"key":"10292_CR10","volume-title":"Reinforcement learning and optimal control","author":"DP Bertsekas","year":"2019","unstructured":"Bertsekas, D.P.: Reinforcement learning and optimal control. Athena Scientific, Belmont (2019)"},{"key":"10292_CR11","volume-title":"Encyclopedia of machine learning","author":"MG Lagoudakis","year":"2010","unstructured":"Lagoudakis, M.G.: Value Function Approximation. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of machine learning. Springer, New York (2010)"},{"key":"10292_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., et al.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28, 58 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9734-0","journal-title":"J. Comb. Optim."},{"key":"10292_CR13","unstructured":"Glover, F., Kochenberger, G., Du, Y.: A tutorial on formulating and using QUBO models (2014). Preprint at arXiv:1811.11538 [cs.DS]"},{"key":"10292_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-4149(89)90040-9","volume":"33","author":"B Apolloni","year":"1989","unstructured":"Apolloni, B., Carvalho, C., de Falco, D.: Quantum stochastic optimization. Stoch. Process. Appl. 33, 233 (1989). https:\/\/doi.org\/10.1016\/0304-4149(89)90040-9","journal-title":"Quantum stochastic optimization. Stoch. Process. Appl."},{"key":"10292_CR15","doi-asserted-by":"publisher","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58, 5355 (1998). https:\/\/doi.org\/10.1103\/PhysRevE.58.5355, arXiv:cond-mat\/9804280","DOI":"10.1103\/PhysRevE.58.5355"},{"key":"10292_CR16","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1126\/science.284.5415.77arXiv:cond-mat\/0105238","volume":"284","author":"J Brooke","year":"1999","unstructured":"Brooke, J., Bitko, D., Rosenbaum, T.F., Aeppli, G.: Quantum annealing of a disordered magnet. Science 284, 779 (1999). https:\/\/doi.org\/10.1126\/science.284.5415.77arXiv:cond-mat\/0105238","journal-title":"Science"},{"key":"10292_CR17","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution (2000). Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/0001106"},{"key":"10292_CR18","doi-asserted-by":"publisher","unstructured":"Farhi, E., et al.: A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292, 472 (2001). https:\/\/doi.org\/10.1126\/science.1057726, arXiv:quant-ph\/0104129","DOI":"10.1126\/science.1057726"},{"key":"10292_CR19","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: Quantum adiabatic evolution algorithms versus simulated annealing (2002). Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/0201031"},{"key":"10292_CR20","doi-asserted-by":"publisher","unstructured":"Aharonov, D., et al.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM J. Comput. 37, 166 (2007). https:\/\/doi.org\/10.1137\/S0097539705447323, arXiv:quant-ph\/0405098","DOI":"10.1137\/S0097539705447323"},{"key":"10292_CR21","doi-asserted-by":"publisher","unstructured":"Somma, R.D., Nagaj, D., Kieferov\u00e1, M.: Quantum speedup by quantum annealing. Phys. Rev. Lett. 109, 050501 (2012). https:\/\/doi.org\/10.1103\/PhysRevLett.109.050501, arXiv:1202.6257 [quant-ph]","DOI":"10.1103\/PhysRevLett.109.050501"},{"key":"10292_CR22","doi-asserted-by":"publisher","unstructured":"Lucas, A.: Ising formulation of many NP problems. Front. Phys. 2, 5 (2014). https:\/\/doi.org\/10.3389\/fphy.2014.00005, arXiv:1302.5843 [cond-mat.stat-mech]","DOI":"10.3389\/fphy.2014.00005"},{"key":"10292_CR23","doi-asserted-by":"publisher","first-page":"56","DOI":"10.3389\/fphy.2014.00056","volume":"2","author":"Z Bain","year":"2014","unstructured":"Bain, Z., et al.: Discrete optimization using quantum annealing on sparse Ising models. Front. Phys. 2, 56 (2014). https:\/\/doi.org\/10.3389\/fphy.2014.00056","journal-title":"Front. Phys."},{"key":"10292_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-02518-1","volume-title":"Adiabatic quantum computation and quantum annealing: theory and practice","author":"CC McGeoch","year":"2014","unstructured":"McGeoch, C.C.: Adiabatic quantum computation and quantum annealing: theory and practice. Morgan & Claypool, San Rafael (2014)"},{"key":"10292_CR25","doi-asserted-by":"publisher","unstructured":"Albash, T., Lidar, D.A.: Adiabatic quantum computation. Rev. Mod. Phys. 90, 015002 (2018). https:\/\/doi.org\/10.1103\/RevModPhys.90.015002, arXiv:1611.04471 [quant-ph]","DOI":"10.1103\/RevModPhys.90.015002"},{"key":"10292_CR26","doi-asserted-by":"publisher","unstructured":"Venegas-Andraca, S.E., Cruz-Santos, W., McGeoch, C.C., Lanzagorta, M.: A cross-disciplinary introduction to quantum annealing-based algorithms. Contemp. Phys. 59, 174 (2018). https:\/\/doi.org\/10.1080\/00107514.2018.1450720, arXiv:1803.03372 [quant-ph]","DOI":"10.1080\/00107514.2018.1450720"},{"key":"10292_CR27","doi-asserted-by":"publisher","unstructured":"Yarkoni, S., Raponi, E., B\u00e4ck, T., Schmitt, S.: Quantum annealing for industry applications: introduction and review. Rep. Prog. Phys. 85, 104001 (2022). https:\/\/doi.org\/10.1088\/1361-6633\/ac8c54, arXiv:2112.07491 [quant-ph]","DOI":"10.1088\/1361-6633\/ac8c54"},{"key":"10292_CR28","doi-asserted-by":"publisher","unstructured":"Berkeley, A.J., et al.: A scalable readout system for a superconducting adiabatic quantum optimization system. Supercond. Sci. Technol. 23, 105014 (2010). https:\/\/doi.org\/10.1088\/0953-2048\/23\/10\/105014, arXiv:0905.0891 [cond-mat.supr-con]","DOI":"10.1088\/0953-2048\/23\/10\/105014"},{"key":"10292_CR29","doi-asserted-by":"publisher","unstructured":"Johnson, M.W., et al.: A scalable control system for a superconducting adiabatic quantum optimization processor. Supercond. Sci. Technol. 23, 065004 (2010). https:\/\/doi.org\/10.1088\/0953-2048\/23\/6\/065004, arXiv:0907.3757 [quant-ph]","DOI":"10.1088\/0953-2048\/23\/6\/065004"},{"key":"10292_CR30","doi-asserted-by":"publisher","unstructured":"Harris, R., et al.: Experimental demonstration of a robust and scalable flux qubit. Phys. Rev. B 81, 134510 (2010). https:\/\/doi.org\/10.1103\/PhysRevB.81.134510, arXiv:0909.4321 [cond-mat.supr-con]","DOI":"10.1103\/PhysRevB.81.134510"},{"key":"10292_CR31","doi-asserted-by":"publisher","unstructured":"Harris, R., et al.: Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor. Phys. Rev. B 82, 024511 (2010). https:\/\/doi.org\/10.1103\/PhysRevB.82.024511, arXiv:1004.1628 [cond-mat.supr-con]","DOI":"10.1103\/PhysRevB.82.024511"},{"key":"10292_CR32","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson, M.W., et al.: Quantum annealing with manufactured spins. Nature 473, 194 (2011). https:\/\/doi.org\/10.1038\/nature10012","journal-title":"Nature"},{"key":"10292_CR33","doi-asserted-by":"publisher","first-page":"1903","DOI":"10.1038\/ncomms2920","volume":"4","author":"N Dickson","year":"2013","unstructured":"Dickson, N., et al.: Thermally assisted quantum annealing of a 16-qubit problem. Nature Commun. 4, 1903 (2013). https:\/\/doi.org\/10.1038\/ncomms2920","journal-title":"Nature Commun."},{"key":"10292_CR34","doi-asserted-by":"publisher","unstructured":"Boixo, S., et al.: Evidence for quantum annealing with more than one hundred qubits. Nature Phys. 10, 218 (2014). https:\/\/doi.org\/10.1038\/nphys2900, arXiv:1304.4595 [quant-ph]","DOI":"10.1038\/nphys2900"},{"key":"10292_CR35","doi-asserted-by":"publisher","unstructured":"Lanting, T., et al.: Entanglement in a quantum annealing processor. Phys. Rev. X 4, 021041 (2014). https:\/\/doi.org\/10.1103\/PhysRevX.4.021041, arXiv:1401.3500 [quant-ph]","DOI":"10.1103\/PhysRevX.4.021041"},{"key":"10292_CR36","doi-asserted-by":"publisher","unstructured":"Bunyk, P.I., et al.: Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor. IEEE Trans. Appl. Supercond. 24, 1700110 (2014). https:\/\/doi.org\/10.1109\/TASC.2014.2318294, arXiv:1401.5504 [quant-ph]","DOI":"10.1109\/TASC.2014.2318294"},{"key":"10292_CR37","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MC.2019.2908836","volume":"52","author":"CC McGeoch","year":"2019","unstructured":"McGeoch, C.C., Harris, R., Reinhardt, S.P., Bunyk, P.I.: Practical Annealing-Based Quantum Computing. Computer 52, 38 (2019). https:\/\/doi.org\/10.1109\/MC.2019.2908836","journal-title":"Computer"},{"key":"10292_CR38","doi-asserted-by":"crossref","unstructured":"Parekh, O., et al.: Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis (2016). Preprint at https:\/\/arxiv.org\/abs\/1604.00319 [quant-ph]","DOI":"10.2172\/1459086"},{"key":"10292_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3459606","volume":"26","author":"M J\u00fcnger","year":"2021","unstructured":"J\u00fcnger, M., et al.: Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics 26, 1\u201391 (2021). https:\/\/doi.org\/10.1145\/3459606","journal-title":"ACM J. Exp. Algorithmics"},{"key":"10292_CR40","doi-asserted-by":"publisher","first-page":"4480","DOI":"10.1038\/ncomms5480","volume":"5","author":"ZR Lin","year":"2014","unstructured":"Lin, Z.R., et al.: Josephson parametric phase-locked oscillator and its application to dispersive readout of superconducting qubits. Nature Commun. 5, 4480 (2014). https:\/\/doi.org\/10.1038\/ncomms5480","journal-title":"Nature Commun."},{"key":"10292_CR41","unstructured":"NEC develops the world\u2019s first unit cell facilitating scaling up to a fully-connected quantum annealing architecture (2022). https:\/\/www.nec.com\/en\/press\/202203\/global_20220317_01.html (2022, accessed on 2025\u201303-17)"},{"key":"10292_CR42","unstructured":"Tohoku University and NEC start joint research on computer systems using a newly developed 8-qubit quantum annealing machine. https:\/\/www.nec.com\/en\/press\/202306\/global_20230628_01.html (2023, accessed on 2025\u201303-17)"},{"key":"10292_CR43","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1140\/epjqt\/s40507-021-00094-y","volume":"8","author":"V Canivell","year":"2021","unstructured":"Canivell, V., Forn-D\u00edaz, P., Garcia-Saez, A., Sagastizabal, R.: Startup Qilimanjaro-towards a European full-stack coherent quantum annealer platform. EPJ Quantum Technol. 8, 6 (2021). https:\/\/doi.org\/10.1140\/epjqt\/s40507-021-00094-y","journal-title":"EPJ Quantum Technol."},{"key":"10292_CR44","doi-asserted-by":"crossref","unstructured":"Palacios, A., Garcia-Saez, A., Estarellas, M.P.: A scalable 2-local architecture for quantum annealing of Ising models with arbitrary dimensions (2024). Preprint at https:\/\/arxiv.org\/abs\/2404.06861 [quant-ph]","DOI":"10.1103\/PhysRevApplied.23.054070"},{"key":"10292_CR45","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1126\/science.aah4243","volume":"354","author":"T Inagaki","year":"2016","unstructured":"Inagaki, T., et al.: A coherent Ising machine for 2000-node optimization problems. Science 354, 603 (2016). https:\/\/doi.org\/10.1126\/science.aah4243","journal-title":"Science"},{"key":"10292_CR46","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1126\/science.aah5178","volume":"354","author":"PL McMahon","year":"2016","unstructured":"McMahon, P.L., et al.: A fully programmable 100-spin coherent Ising machine with all-to-all connections. Science 354, 614 (2016). https:\/\/doi.org\/10.1126\/science.aah5178","journal-title":"Science"},{"key":"10292_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-22750-4","volume-title":"Numerical Mathematics","author":"A Quarteroni","year":"2007","unstructured":"Quarteroni, A., Sacco, R., Saleri, F.: Numerical Mathematics, 2nd edn. Springer, Berlin, Heidelberg (2007)","edition":"2"},{"key":"10292_CR48","doi-asserted-by":"publisher","unstructured":"Eichmann, G., Sanchis-Alepuz, H., Williams, R., Alkofer, R., Fischer, C.S.: Baryons as relativistic three-quark bound states. Prog. Part. Nucl. Phys. 91, 1 (2016). https:\/\/doi.org\/10.1016\/j.ppnp.2016.07.001, arXiv:1606.09602 [hep-ph]","DOI":"10.1016\/j.ppnp.2016.07.001"},{"key":"10292_CR49","doi-asserted-by":"publisher","unstructured":"Sanchis-Alepuz, H., Williams, R.: Recent developments in bound-state calculations using the Dyson-Schwinger and Bethe-Salpeter equations. Comput. Phys. Commun. 232, 1 (2018). https:\/\/doi.org\/10.1016\/j.cpc.2018.05.020, arXiv:1710.04903 [hep-ph]","DOI":"10.1016\/j.cpc.2018.05.020"},{"key":"10292_CR50","volume-title":"The NIST Handbook of Mathematical Functions","author":"F Olver","year":"2010","unstructured":"Olver, F., Lozier, D., Boisvert, R., Clark, C.: The NIST Handbook of Mathematical Functions. Cambridge University Press, Cambridge (2010)"},{"key":"10292_CR51","volume-title":"Generalized Inverses: Theory and Applications","author":"A Ben-Israel","year":"2003","unstructured":"Ben-Israel, A., Greville, T.N.E.: Generalized Inverses: Theory and Applications, 2nd edn. Springer, New York (2003)","edition":"2"},{"key":"10292_CR52","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu Search-Part I. ORSA J. Comput. 1, 190 (1989). https:\/\/doi.org\/10.1287\/ijoc.1.3.190","journal-title":"ORSA J. Comput."},{"key":"10292_CR53","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu Search-Part II. ORSA J. Comput. 2, 4 (1990). https:\/\/doi.org\/10.1287\/ijoc.2.1.4","journal-title":"ORSA J. Comput."},{"key":"10292_CR54","unstructured":"D-Wave System Documentation (2025). https:\/\/docs.dwavesys.com\/docs\/latest\/index.html (accessed on 2025\u201302-04)"},{"key":"10292_CR55","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02980577","volume":"31","author":"E Ising","year":"1925","unstructured":"Ising, E.: Beitrag zur Theorie des Ferromagnetismus. Z. Phys. 31, 253 (1925). https:\/\/doi.org\/10.1007\/BF02980577","journal-title":"Z. Phys."},{"key":"10292_CR56","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511622786","volume-title":"Statistical Field Theory-Volume 1: From Brownian Motion to Renormalization and Lattice Gauge Theory","author":"C Itzykson","year":"1989","unstructured":"Itzykson, C., Drouffe, J.-M.: Statistical Field Theory-Volume 1: From Brownian Motion to Renormalization and Lattice Gauge Theory. Cambridge University Press, Cambridge (1989)"},{"key":"10292_CR57","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/B:ANOR.0000039522.58036.68","volume":"131","author":"G Palubeckis","year":"2004","unstructured":"Palubeckis, G.: Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem. Ann. Oper. Res. 131, 259 (2004). https:\/\/doi.org\/10.1023\/B:ANOR.0000039522.58036.68","journal-title":"Ann. Oper. Res."},{"key":"10292_CR58","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/net.21751","volume":"70","author":"M Lewis","year":"2017","unstructured":"Lewis, M., Glover, F.: Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis. Networks 70, 79 (2017). https:\/\/doi.org\/10.1002\/net.21751","journal-title":"Networks"},{"key":"10292_CR59","doi-asserted-by":"publisher","unstructured":"Glover, F., Lewis, M., Kochenberger, G.: Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems. Eur. J. Op. Res. 265, 829 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.08.025, arXiv:1705.09545 [cs.AI]","DOI":"10.1016\/j.ejor.2017.08.025"},{"key":"10292_CR60","doi-asserted-by":"crossref","unstructured":"Suppakitpaisarn, V., Hao, J.-K.: Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver (2024). Preprint at https:\/\/arxiv.org\/abs\/2401.13004 [math.OC]","DOI":"10.1007\/978-3-031-62912-9_22"},{"key":"10292_CR61","doi-asserted-by":"publisher","unstructured":"Tiunov, E.S., Ulanov, A.E., Lvovsky, A.I.: Annealing by simulating the coherent Ising machine. Optics Express 27, 8505 (2019). https:\/\/doi.org\/10.1364\/OE.27.010288, arXiv:1901.08927 [quant-ph]","DOI":"10.1364\/OE.27.010288"},{"key":"10292_CR62","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1111\/itor.13420","volume":"32","author":"Y Du","year":"2025","unstructured":"Du, Y., et al.: New advances for quantum-inspired optimization. Intl. Trans. Op. Res. 32, 6 (2025). https:\/\/doi.org\/10.1111\/itor.13420","journal-title":"Intl. Trans. Op. Res."},{"key":"10292_CR63","doi-asserted-by":"publisher","unstructured":"Hamerly, R., et al.: Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer. Sci. Adv. 5, 1 (2019). https:\/\/doi.org\/10.1126\/sciadv.aau0823, arXiv:1805.05217 [quant-ph]","DOI":"10.1126\/sciadv.aau0823"},{"key":"10292_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1126\/sciadv.ads7223","volume":"11","author":"H Takesue","year":"2025","unstructured":"Takesue, H., et al.: Finding independent sets in large-scale graphs with a coherent Ising machine. Sci. Adv. 11, 1 (2025). https:\/\/doi.org\/10.1126\/sciadv.ads7223","journal-title":"Sci. Adv."},{"key":"10292_CR65","unstructured":"Ferretti, R., Festa, A.: A hybrid control approach to the route planning problem for sailing boats (2017). Preprint at https:\/\/arxiv.org\/abs\/1707.08103 [math.NA]"},{"key":"10292_CR66","unstructured":"Miles, C., Vladimirsky, A.: Stochastic Optimal Control of a Sailboat (2021). Preprint at https:\/\/arxiv.org\/abs\/2109.08260 [math.OC]"},{"key":"10292_CR67","unstructured":"Wang, M., Patnaik, N., Somalwar, A., Wu, J., Vladimirsky, A.: Risk-aware stochastic control of a sailboat (2023). Preprint at https:\/\/arxiv.org\/abs\/2309.13436 [math.OC]"},{"key":"10292_CR68","doi-asserted-by":"publisher","unstructured":"Sirignano, J., Spiliopoulos, K.: DGM: A deep learning algorithm for solving partial differential equations. J. Comput. Phys. 375, 1339 (2018). https:\/\/doi.org\/10.1016\/j.jcp.2018.08.029, arXiv:1708.07469 [q-fin.MF]","DOI":"10.1016\/j.jcp.2018.08.029"},{"key":"10292_CR69","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.jcp.2018.10.045","volume":"378","author":"M Raissi","year":"2019","unstructured":"Raissi, M., Perdikaris, P., Karniadakis, G.E.: Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. J. Comput. Phys. 378, 686 (2019). https:\/\/doi.org\/10.1016\/j.jcp.2018.10.045","journal-title":"J. Comput. Phys."},{"key":"10292_CR70","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3577202","volume":"4","author":"C Roch","year":"2023","unstructured":"Roch, C., Ratke, D., N\u00fc\u00dflein, J., Gabor, T., Feld, S.: The Effect of Penalty Factors of Constrained Hamiltonians on the Eigenspectrum in Quantum Annealing. ACM Trans. Quant. Comput. 4, 1 (2023). https:\/\/doi.org\/10.1145\/3577202","journal-title":"ACM Trans. Quant. Comput."},{"key":"10292_CR71","unstructured":"Contributor Role Taxonomy (CRediT) (2015). https:\/\/credit.niso.org (accessed on 2026\u201302-04)"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-026-10292-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-026-10292-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-026-10292-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T22:03:29Z","timestamp":1778709809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-026-10292-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,23]]},"references-count":71,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["10292"],"URL":"https:\/\/doi.org\/10.1007\/s10444-026-10292-w","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,23]]},"assertion":[{"value":"29 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"18"}}