{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T21:43:56Z","timestamp":1743457436708},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6682,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1016\/0166-218x(93)e0115-f","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:52:12Z","timestamp":1027605132000},"page":"281-291","source":"Crossref","is-referenced-by-count":41,"title":["Distances between traveling salesman tours"],"prefix":"10.1016","volume":"58","author":[{"given":"King-Tim","family":"Mak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Morton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)E0115-F_BIB1","series-title":"Proceedings of the 17th Colloquium on Automata, Languages and Programming","first-page":"446","article-title":"Local optimization and the travelling salesman problem","author":"Johnson","year":"1990"},{"key":"10.1016\/0166-218X(93)E0115-F_BIB2","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the travelling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)E0115-F_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(93)90001-W","article-title":"A modified Lin-Kernighan travelling-salesman heuristic","volume":"13","author":"Mak","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(93)E0115-F_BIB4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","article-title":"A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Rev."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0115F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0115F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T00:24:01Z","timestamp":1556497441000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93E0115F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["0166218X93E0115F"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)e0115-f","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}