{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:40:04Z","timestamp":1755801604732,"version":"3.44.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/indin41052.2019.8972232","type":"proceedings-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T00:16:43Z","timestamp":1580429803000},"page":"847-852","source":"Crossref","is-referenced-by-count":3,"title":["Predicting the difficulty of TSP instances using MST"],"prefix":"10.1109","author":[{"given":"Lahari","family":"Sengupta","sequence":"first","affiliation":[{"name":"University of Eastern Finland,School of Computing,Joensuu,Finland"}]},{"given":"Pasi","family":"Fr\u00e4nti","sequence":"additional","affiliation":[{"name":"University of Eastern Finland,School of Computing,Joensuu,Finland"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.7771\/1932-6246.1117"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72903-7_27"},{"journal-title":"Rogaining cross-country navigation","year":"1982","author":"phillips","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3115935"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/2033241"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"journal-title":"The Traveling Salesman Problem A Computational Study","year":"2011","author":"applegate","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s42113-018-0018-0"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.10.012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1068\/p2863"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3758\/BF03213088"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3758\/BF03196857"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3758\/BF03211819"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.7771\/1932-6246.1160"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3758\/BF03196130"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.7771\/1932-6246.1004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3758\/BF03211820"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-8869(03)00200-9"},{"article-title":"Which local search operator works best for open loop Euclidean TSP?","year":"0","author":"sengupta","key":"ref20"}],"event":{"name":"2019 IEEE 17th International Conference on Industrial Informatics (INDIN)","start":{"date-parts":[[2019,7,22]]},"location":"Helsinki, Finland","end":{"date-parts":[[2019,7,25]]}},"container-title":["2019 IEEE 17th International Conference on Industrial Informatics (INDIN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8961950\/8972012\/08972232.pdf?arnumber=8972232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T18:35:34Z","timestamp":1755714934000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8972232\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/indin41052.2019.8972232","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}