{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:48:55Z","timestamp":1772808535800,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"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":[[1982,7]]},"DOI":"10.1016\/0167-6377(82)90002-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"85-88","source":"Crossref","is-referenced-by-count":12,"title":["Identification of non-optimal arcs for the travelling salesman problem"],"prefix":"10.1016","volume":"1","author":[{"given":"Roy","family":"Jonker","sequence":"first","affiliation":[]},{"given":"Ton","family":"Volgenant","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(82)90002-5_BIB1","series-title":"Integer Programming","author":"Garfinkel","year":"1972"},{"key":"10.1016\/0167-6377(82)90002-5_BIB2","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1287\/opre.28.5.1219","article-title":"Data-dependent bounds for heuristics to find a minimum weight hamiltonian circuit","volume":"28","author":"Jonker","year":"1980","journal-title":"Operations Res."},{"key":"10.1016\/0167-6377(82)90002-5_BIB3","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0167-6377(82)90002-5_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(82)90015-7","article-title":"A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation","volume":"9","author":"Volgenant","year":"1982","journal-title":"European J. Operations Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900025?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900025?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T11:52:18Z","timestamp":1552909938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637782900025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,7]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,7]]}},"alternative-id":["0167637782900025"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(82)90002-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1982,7]]}}}