{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:48:36Z","timestamp":1776106116412,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"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,9]]},"DOI":"10.1016\/0167-6377(82)90012-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"121-125","source":"Crossref","is-referenced-by-count":92,"title":["An O(N log N) planar travelling salesman heuristic based on spacefilling curves"],"prefix":"10.1016","volume":"1","author":[{"suffix":"III","given":"J.J","family":"Bartholdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.K","family":"Platzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(82)90012-8_BIB1","series-title":"Turtle Geometry: The Computer as a Medium for Exploring Mathematics","author":"Abelson","year":"1982"},{"key":"10.1016\/0167-6377(82)90012-8_BIB2","first-page":"299","article-title":"The shortest path through many points","volume":"55","author":"Beardwood","year":"1959"},{"key":"10.1016\/0167-6377(82)90012-8_BIB3","series-title":"Proc. 18th Annual Allerton Conference on Communication, Control, and Computing","first-page":"41","article-title":"An analysis of two heuristics for the Euclidean travelling salesman problem","author":"Bentley","year":"1980"},{"key":"10.1016\/0167-6377(82)90012-8_BIB4","author":"Hobson","year":"1950"},{"key":"10.1016\/0167-6377(82)90012-8_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","article-title":"Probabilistic analysis of partitioning algorithms for the travelling salesman problem in the plane","volume":"2","author":"Karp","year":"1977","journal-title":"Math. Operations Res."},{"key":"10.1016\/0167-6377(82)90012-8_BIB6","author":"Knuth","year":"1973"},{"key":"10.1016\/0167-6377(82)90012-8_BIB7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The Euclidean travelling salesman problem is NP-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6377(82)90012-8_BIB8_1","unstructured":"L. Platzman and J. Bartholdi, \u201cSpacefilling curves and routing problems in the plane\u201d, J. ACM, to appear."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900128?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900128?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:30Z","timestamp":1552909950000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637782900128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0167637782900128"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(82)90012-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}