{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T12:24:37Z","timestamp":1769603077830,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0020-0190(94)00071-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"141-148","source":"Crossref","is-referenced-by-count":27,"title":["The convex-hull-and-line traveling salesman problem: a solvable case"],"prefix":"10.1016","volume":"51","author":[{"given":"Vladimir G.","family":"Deineko","sequence":"first","affiliation":[]},{"given":"Ren\u00e9","family":"van Dal","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00071-9_BIB1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix-searching algorithm","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(94)00071-9_BIB2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/net.3230100302","article-title":"Efficient special case algorithms for the N-line planar traveling salesman problem","volume":"10","author":"Cutler","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0020-0190(94)00071-9_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.4.1.61","article-title":"The traveling-salesman problem","volume":"4","author":"Flood","year":"1956","journal-title":"Oper. Res."},{"key":"10.1016\/0020-0190(94)00071-9_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The Euclidean traveling salesman problem is NP-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(94)00071-9_BIB5","doi-asserted-by":"crossref","first-page":"977","DOI":"10.2307\/2313333","article-title":"On some properties of shortest Hamiltonian circuits","volume":"72","author":"Quintas","year":"1965","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0020-0190(94)00071-9_BIB6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/net.3230220106","article-title":"The N-line traveling salesman problem","volume":"22","author":"Rote","year":"1992","journal-title":"Networks"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000719?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000719?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:51:19Z","timestamp":1555145479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000719"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0020019094000719"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00071-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}