{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T06:05:07Z","timestamp":1750831507899,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"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":[[2024,6,30]]},"DOI":"10.1109\/cec60901.2024.10612021","type":"proceedings-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T17:55:15Z","timestamp":1723139715000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Neural Combinatorial Optimization by Means of Partial Solution Strategies"],"prefix":"10.1109","author":[{"given":"Andoni Irazusta","family":"Garmendia","sequence":"first","affiliation":[{"name":"University of the Basque Country (UPV\/EHU),Donostia-San Sebastian,Spain"}]},{"given":"Josu","family":"Ceberio","sequence":"additional","affiliation":[{"name":"University of the Basque Country (UPV\/EHU),Donostia-San Sebastian,Spain"}]},{"given":"Alexander","family":"Mendiburu","sequence":"additional","affiliation":[{"name":"University of the Basque Country (UPV\/EHU),Donostia-San Sebastian,Spain"}]}],"member":"263","reference":[{"volume-title":"Combinatorial optimization: algorithms and complexity","year":"1998","author":"Papadimitriou","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref4","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016","journal-title":"ar Xiv preprint"},{"key":"ref5","article-title":"Neural combi-natorial optimization: a new player in the field","author":"Garmendia","year":"2022","journal-title":"ar Xiv preprint"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2979670"},{"article-title":"Learning tsp requires rethinking generalization","volume-title":"27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Schloss Dagstuhl-Leibniz-Zentrum fur Informatik","author":"Joshi","key":"ref7"},{"key":"ref8","first-page":"21188","article-title":"Pomo: Policy optimization with multiple optima for reinforcement learning","volume":"33","author":"Kwon","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref9","article-title":"Learning heuristics over large graphs via deep reinforcement learning","author":"Manchanda","year":"2019","journal-title":"arXiv preprint"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790280"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.041"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0648-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/1907514"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican1051-15"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3115\/1699571.1699644"},{"key":"ref16","volume":"174","author":"Garey","year":"1979","journal-title":"Computers and intractability. freeman San Francisco"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9384-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012793906010"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-64877-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.131"},{"key":"ref23","article-title":"A diversity-aware memetic algorithm for the linear ordering problem","author":"Lugo","year":"2021","journal-title":"arXiv preprint"},{"key":"ref24","article-title":"Linear ordering library (lolib)","author":"Reinelt","year":"2002","journal-title":"University of Heidelberg, Dec"},{"article-title":"Das helmstadtersche reihenfolgeproblem-die effizienz ver-schiedener naherungsverfahren","volume-title":"Computer uses in the Social Sciences, Berichteiner Working Conference","author":"Becker","key":"ref25"},{"key":"ref26","article-title":"The traveling salesman problem","volume-title":"The Traveling Salesman Problem","author":"Applegate","year":"2011"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"}],"event":{"name":"2024 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2024,6,30]]},"location":"Yokohama, Japan","end":{"date-parts":[[2024,7,5]]}},"container-title":["2024 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10609966\/10611750\/10612021.pdf?arnumber=10612021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T04:12:53Z","timestamp":1723349573000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10612021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,30]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/cec60901.2024.10612021","relation":{},"subject":[],"published":{"date-parts":[[2024,6,30]]}}}