{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:45:01Z","timestamp":1740102301838,"version":"3.37.3"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T00:00:00Z","timestamp":1694995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T00:00:00Z","timestamp":1694995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,18]]},"DOI":"10.1109\/ispa58351.2023.10278690","type":"proceedings-article","created":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T17:58:32Z","timestamp":1697738312000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Finding Hamiltonian Cycles with Graph Neural Networks"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4888-5912","authenticated-orcid":false,"given":"Filip","family":"Bosni\u0107","sequence":"first","affiliation":[{"name":"University of Zagreb,Faculty of Electrical Engineering and Computing,Zagreb,Croatia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8370-0891","authenticated-orcid":false,"given":"Mile","family":"\u0160iki\u0107","sequence":"additional","affiliation":[{"name":"Genome Institute of Singapore, A*STAR,Laboratory of AI in Genomics,Singapore"}]}],"member":"263","reference":[{"volume-title":"Concorde - a code for solving traveling salesman problems","year":"2001","author":"Applegate","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1007\/BF01782475"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1038\/nmeth.1935"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/j.ejor.2020.07.063"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1137\/110839229"},{"volume-title":"The transformer network for the traveling salesman problem","year":"2021","author":"Bresson","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/MSP.2017.2693418"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.24963\/ijcai.2021\/595"},{"key":"ref9","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proceedings of the 34th International Conference on Machine Learning","volume":"70","author":"Gilmer","year":"2017"},{"key":"ref10","article-title":"Fhcp challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem","author":"Haythorpe","year":"2019","journal-title":"arXiv preprint"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/j.ejor.2014.03.042"},{"key":"ref12","article-title":"Thomas Laurent, and Xavier Bresson","author":"Joshi","year":"2019","journal-title":"An efficient graph convolutional network technique for the travelling salesman problem"},{"key":"ref13","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Advances in neural information processing systems"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1038\/s41592-020-00971-x"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/0012-365X(83)90021-3"},{"volume-title":"Attention, learn to solve routing problems!","year":"2019","author":"Kool","key":"ref16"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/IJCNN.1990.137940"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/S0893-6080(05)80132-7"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1038\/s41586-020-2547-7"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1093\/bioinformatics\/bti1114"},{"volume-title":"Automatic differentiation in pytorch","year":"2017","author":"Paszke","key":"ref21"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1093\/bib\/bbp026"},{"volume-title":"{TSPLIB}: a library of sample instances for the tsp (and related problems) from various sources and of various types","year":"2014","author":"Reinhelt","key":"ref23"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1137\/1.9781611976700.38"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1155\/2018\/9328103"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.3389\/frai.2020.580607"},{"key":"ref27","article-title":"One model, any csp: Graph neural networks as fast global search heuristics for constraint satisfaction","author":"T\u00f6nshoff","year":"2022","journal-title":"arXiv preprint"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1038\/s43588-021-00073-4"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1016\/j.patter.2021.100273"},{"volume-title":"Graph attention networks","year":"2018","author":"Veli\u010dkovi\u0107","key":"ref30"},{"key":"ref31","article-title":"Neural execution of graph algorithms","volume-title":"International Conference on Learning Representations","author":"Veli\u010dkovi\u0107","year":"2020"},{"key":"ref32","article-title":"A step towards neural genome assembly","author":"Vr\u010dek","year":"2020","journal-title":"Learning Meets Combinatorial Algorithms at NeurIPS2020"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/CEC.1999.782656"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/ACCESS.2020.3000236"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1016\/j.aiopen.2021.01.001"}],"event":{"name":"2023 International Symposium on Image and Signal Processing and Analysis (ISPA)","start":{"date-parts":[[2023,9,18]]},"location":"Rome, Italy","end":{"date-parts":[[2023,9,19]]}},"container-title":["2023 International Symposium on Image and Signal Processing and Analysis (ISPA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10278502\/10278578\/10278690.pdf?arnumber=10278690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T08:55:12Z","timestamp":1709369712000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10278690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,18]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/ispa58351.2023.10278690","relation":{},"subject":[],"published":{"date-parts":[[2023,9,18]]}}}