{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:53:18Z","timestamp":1775065998979,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819778003","type":"print"},{"value":"9789819778010","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7801-0_12","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"134-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantum Annealing and\u00a0GNN for\u00a0Solving TSP with\u00a0QUBO"],"prefix":"10.1007","author":[{"given":"Haoqi","family":"He","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Boixo, S., R\u00f8nnow, T., Isakov, S., et al.: Evidence for quantum annealing with more than one hundred qubits. Nat. Phys. 10, 218\u2013224 (2014). https:\/\/doi.org\/10.1038\/nphys2900","DOI":"10.1038\/nphys2900"},{"issue":"14","key":"12_CR2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.130.140601","volume":"130","author":"LP Garc\u00eda-Pintos","year":"2023","unstructured":"Garc\u00eda-Pintos, L.P., Brady, L.T., Bringewatt, J., et al.: Lower bounds on quantum annealing times. Phys. Rev. Lett. 130(14), 140601 (2023)","journal-title":"Phys. Rev. Lett."},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Mohseni, N., McMahon, P.L., Byrnes, T.: Ising machines as hardware solvers of combinatorial optimization problems. Nat. Rev. Phys. 4, 363\u2013379 (2022). https:\/\/doi.org\/10.1038\/s42254-022-00440-8","DOI":"10.1038\/s42254-022-00440-8"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Date, P., Arthur, D., Pusey-Nazzaro, L.: QUBO formulations for training machine learning models. Sci. Rep. 11, 10029 (2021). https:\/\/doi.org\/10.1038\/s41598-021-89461-4","DOI":"10.1038\/s41598-021-89461-4"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"KA Smith","year":"1999","unstructured":"Smith, K.A.: Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1), 15\u201334 (1999)","journal-title":"INFORMS J. Comput."},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Alom, M.Z., Van Essen, B., Moody, A.T., Widemann, D.P., Taha, T.M.: Quadratic unconstrained binary optimization (QUBO) on neuromorphic computing system. In: 2017 International Joint Conference on Neural Networks (IJCNN), Anchorage, AK, USA, pp. 3922\u20133929 (2017). https:\/\/doi.org\/10.1109\/IJCNN.2017.7966350","DOI":"10.1109\/IJCNN.2017.7966350"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Landge, S., Saraswat, V., Singh, S.F., Ganguly, U.: n-oscillator neural network based efficient cost function for n-city traveling salesman problem. In: 2020 International Joint Conference on Neural Networks (IJCNN), Glasgow, UK, pp. 1\u20138 (2020). https:\/\/doi.org\/10.1109\/IJCNN48605.2020.9206856","DOI":"10.1109\/IJCNN48605.2020.9206856"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Schuetz, M.J.A., Brubaker, J.K., Katzgraber, H.G.: Combinatorial optimization with physics-inspired graph neural networks. Nat. Mach. Intell. 4, 367\u2013377 (2022). https:\/\/doi.org\/10.1038\/s42256-022-00468-6","DOI":"10.1038\/s42256-022-00468-6"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Fu, Z.H., Qiu, K.B., Zha, H.: Generalize a small pre-trained model to arbitrarily large TSP instances. Proc. AAAI Conf. Artif. Intell. 35(8), 7474\u20137482 (2021)","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Glover, F., Kochenberger, G., Du, Y.: Quantum bridge analytics I: a tutorial on formulating and using QUBO models. 4OR-Q J. Oper. Res. 17, 335\u2013371 (2019)","DOI":"10.1007\/s10288-019-00424-y"},{"key":"12_CR11","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\u2013475 (2001). https:\/\/doi.org\/10.1126\/science.1057726","DOI":"10.1126\/science.1057726"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Silva, C., Aguiar, A., Lima, P.M.V., et al.: Mapping a logical representation of TSP to quantum annealing. Quantum Inf. Process. 20, 386 (2021). https:\/\/doi.org\/10.1007\/s11128-021-03321-8","DOI":"10.1007\/s11128-021-03321-8"},{"key":"12_CR13","unstructured":"Pop, P.C., Cosma, O., Sabo, C., et al.: A comprehensive survey on the generalized traveling salesman problem. Eur. J. Oper. Res. (2023)"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Arute, F., Arya, K., Babbush, R., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574, 505\u2013510 (2019). https:\/\/doi.org\/10.1038\/s41586-019-1666-5","DOI":"10.1038\/s41586-019-1666-5"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Glos, A., Krawiec, A., Zimbor\u00e1s, Z.: Space-efficient binary optimization for variational quantum computing. npj Quantum Inf. 8, 39 (2022). https:\/\/doi.org\/10.1038\/s41534-022-00546-y","DOI":"10.1038\/s41534-022-00546-y"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Yang, H.: TSP combination optimization with semi-local attention mechanism. In: Iliadis, L., Papaleonidas, A., Angelov, P., Jayne, C. (eds.) ICANN 2023. LNCS, vol. 14262, pp. 469\u2013481. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-44201-8(38)","DOI":"10.1007\/978-3-031-44201-8(38)"},{"key":"12_CR17","unstructured":"Min, Y., Bai, Y., Gomes, C.P.: Unsupervised learning for solving the travelling salesman problem. arXiv preprint arXiv:2303.10538 (2023)"},{"issue":"1","key":"12_CR18","first-page":"1","volume":"1","author":"R Matai","year":"2010","unstructured":"Matai, R., Singh, S.P., Mittal, M.L.: Traveling salesman problem: an overview of applications, formulations, and solution approaches. Traveling Salesman Probl. Theory Appl. 1(1), 1\u201325 (2010)","journal-title":"Traveling Salesman Probl. Theory Appl."},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1109\/TC.2021.3063618","volume":"71","author":"M Zaman","year":"2021","unstructured":"Zaman, M., Tanahashi, K., Tanaka, S.: PyQUBO: Python library for mapping combinatorial optimization problems to QUBO form. IEEE Trans. Comput. 71(4), 838\u2013850 (2021)","journal-title":"IEEE Trans. Comput."},{"issue":"36","key":"12_CR20","doi-asserted-by":"publisher","first-page":"R393","DOI":"10.1088\/0305-4470\/39\/36\/R01","volume":"39","author":"GE Santoro","year":"2006","unstructured":"Santoro, G.E., Tosatti, E.: Optimization using quantum mechanics: quantum annealing through adiabatic evolution. J. Phys. A: Math. Gen. 39(36), R393 (2006)","journal-title":"J. Phys. A: Math. Gen."},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.91.012104","volume":"91","author":"H Nishimori","year":"2015","unstructured":"Nishimori, H., Tsuda, J., Knysh, S.: Comparative study of the performance of quantum annealing and simulated annealing. Phys. Rev. E 91(1), 012104 (2015)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0377-2217(96)00007-0","volume":"92","author":"M Pirlot","year":"1996","unstructured":"Pirlot, M.: General local search methods. Eur. J. Oper. Res. 92(3), 493\u2013511 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F Liu","year":"2009","unstructured":"Liu, F., Zeng, G.: Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Syst. Appl. 36(3), 6995\u20137001 (2009)","journal-title":"Expert Syst. Appl."},{"key":"12_CR24","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"12_CR25","unstructured":"Liu, W., Wen, Y., Yu, Z., et al.: Large-margin softmax loss for convolutional neural networks. arXiv preprint arXiv:1612.02295 (2016)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Obermeyer, Z., Emanuel, E.J.: Predicting the future-big data, machine learning, and clinical medicine. N. Engl. J. Med. 375, 1216 (2016)","DOI":"10.1056\/NEJMp1606181"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0168-1699(95)98601-9","volume":"12","author":"RJ McQueen","year":"1995","unstructured":"McQueen, R.J., Garner, S.R., Nevill-Manning, C.G., Witten, I.H.: Applying machine learning to agricultural data. Comput. Electron. Agric. 12, 275\u2013293 (1995)","journal-title":"Comput. Electron. Agric."},{"issue":"1","key":"12_CR28","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(93)90145-D","volume":"65","author":"D Bertsimas","year":"1993","unstructured":"Bertsimas, D., Howell, L.H.: Further results on the probabilistic traveling salesman problem. Eur. J. Oper. Res. 65(1), 68\u201395 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR29","unstructured":"Ying, Z., Bourgeois, D., You, J., et al.: GNNExplainer: generating explanations for graph neural networks. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Fu, Z.-H., Qiu, K.-B., Zha, H.: Generalize a small pre-trained model to arbitrarily large TSP instances. Proc. AAAI Conf. Artif. Intell. 35(8), 7474\u20137482 (2021). https:\/\/doi.org\/10.1609\/aaai.v35i8.16916","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-93031-2_12","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"M Deudon","year":"2018","unstructured":"Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., Rousseau, L.-M.: Learning heuristics for the TSP by policy gradient. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 170\u2013181. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_12"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7801-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:08:36Z","timestamp":1726769316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7801-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819778003","9789819778010"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7801-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}