{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T19:51:38Z","timestamp":1761162698534,"version":"build-2065373602"},"reference-count":4,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"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,10,19]]},"DOI":"10.1109\/csit61576.2023.10324172","type":"proceedings-article","created":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T14:36:06Z","timestamp":1701095766000},"page":"1-4","source":"Crossref","is-referenced-by-count":2,"title":["Solving Large Scale Uniform Traveling Salesman Problem by Using Partial Solution Expansion Method"],"prefix":"10.1109","author":[{"given":"Roman","family":"Kutelmakh","sequence":"first","affiliation":[{"name":"Lviv Polytechnic National University,Software department,Lviv,Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Bazylevych","sequence":"additional","affiliation":[{"name":"Lviv Polytechnic National University,Software department,Lviv,Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhanu","family":"Prasad","sequence":"additional","affiliation":[{"name":"Florida A&M University,Department of Computer and Information Sciences,Tallahassee,Florida,USA,32307"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems","year":"2017","author":"Helsgaun","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.06.039"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.30890\/2567-5273.2023-26-01-063"},{"article-title":"GalaxyTSP: A New Billion-Node Benchmark for TSP","volume-title":"1st Workshop on Learning Meets Combinatorial Algorithms @ NeurIPS 2020","author":"Drori","key":"ref7"}],"event":{"name":"2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT)","start":{"date-parts":[[2023,10,19]]},"location":"Lviv, Ukraine","end":{"date-parts":[[2023,10,21]]}},"container-title":["2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10323600\/10323603\/10324172.pdf?arnumber=10324172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T17:05:28Z","timestamp":1761066328000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10324172\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,19]]},"references-count":4,"URL":"https:\/\/doi.org\/10.1109\/csit61576.2023.10324172","relation":{},"subject":[],"published":{"date-parts":[[2023,10,19]]}}}