{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T16:33:57Z","timestamp":1693067637865},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0167-6377(93)90001-w","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"127-132","source":"Crossref","is-referenced-by-count":20,"title":["A modified Lin-Kernighan traveling-salesman heuristic"],"prefix":"10.1016","volume":"13","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\/0167-6377(93)90001-W_BIB1","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(93)90001-W_BIB2","series-title":"Proceedings of the 17th Colloquium on Automata, Languages and Programming","first-page":"446","article-title":"Local optimization and the traveling salesman problem","author":"Johnson","year":"1990"},{"key":"10.1016\/0167-6377(93)90001-W_BIB3","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(93)90001-W_BIB4","unstructured":"K.-T. Mak and A.J. Morton, \u201cThe Lin-Kernighan traveling-salesman heuristic reconsidered and extended\u201d, UIC CBA Working Paper #91-02."},{"key":"10.1016\/0167-6377(93)90001-W_BIB5","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."},{"key":"10.1016\/0167-6377(93)90001-W_BIB6","unstructured":"G. Reinelt, TSPLIB 1.0, Contact: bixby@rice.edu."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390001W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390001W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:51:34Z","timestamp":1552902694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779390001W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["016763779390001W"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(93)90001-w","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}