{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:22Z","timestamp":1759063762797},"reference-count":7,"publisher":"Elsevier BV","issue":"1","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":["Operations Research Letters"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0167-6377(94)90016-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"11-18","source":"Crossref","is-referenced-by-count":49,"title":["The traveling salesman problem with delivery and backhauls"],"prefix":"10.1016","volume":"16","author":[{"given":"Shoshana","family":"Anily","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0167-6377(94)90016-7_BIB1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","article-title":"Routing and scheduling of vehicles and crews \u2014 state of the Art","volume":"10","author":"Bodin","year":"1983","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0167-6377(94)90016-7_BIB2","series-title":"Studies in Management Science and Systems\/Vehicle Routing: Methods and Studies","first-page":"127","article-title":"Vehicle routing with backhauls: Models, algorithms, and case studies","author":"Casco","year":"1988"},{"key":"10.1016\/0167-6377(94)90016-7_BIB3","series-title":"Technical Report","article-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","author":"Christofides","year":"1976"},{"key":"10.1016\/0167-6377(94)90016-7_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/0167-6377(94)90016-7_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/0377-2217(94)90360-3","article-title":"The traveling salesman problem with pick-up and delivery","volume":"79","author":"Mosheiov","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/0167-6377(94)90016-7_BIB6","series-title":"Combinatorial Optimization Algortihms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0167-6377(94)90016-7_BIB7","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900167?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:52:49Z","timestamp":1552902769000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0167637794900167"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90016-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}