{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T06:56:06Z","timestamp":1781333766946,"version":"3.54.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":[[1996,9]]},"DOI":"10.1016\/0020-0190(96)00125-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"295-301","source":"Crossref","is-referenced-by-count":16,"title":["The Convex-hull-and-k-line Travelling Salesman Problem"],"prefix":"10.1016","volume":"59","author":[{"given":"Vladimir G.","family":"De\u012dneko","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00125-1_BIB1","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(96)00125-1_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(94)00071-9","article-title":"The convex-hull-and-line traveling salesman problem: A solvable case","volume":"51","author":"De\u012dneko","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00125-1_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(96)00125-1_BIB4","series-title":"The Travelling Salesman Problem","first-page":"87","article-title":"Well-solved special cases","author":"Gilmore","year":"1985"},{"key":"10.1016\/0020-0190(96)00125-1_BIB5","series-title":"The Travelling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/0020-0190(96)00125-1_BIB6","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\/0020-0190(96)00125-1_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\/0020-0190(96)00125-1_BIB8","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:0020019096001251?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001251?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:32Z","timestamp":1556058272000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0020019096001251"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00125-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}