{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T04:58:59Z","timestamp":1666155539806},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s11424-022-0280-z","type":"journal-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T14:03:24Z","timestamp":1655733804000},"page":"1902-1909","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Tight Approximation Algorithm for Multi-Vehicle CVRP with Unsplittable Demands on a Line"],"prefix":"10.1007","volume":"35","author":[{"given":"Yuanxiao","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,20]]},"reference":[{"issue":"5","key":"280_CR1","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1007\/s11424-015-4197-7","volume":"29","author":"Q Gao","year":"2016","unstructured":"Gao Q and Lu X W, The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail, Journal of Systems Science & Complexity, 2016, 29(5): 1302\u20131319.","journal-title":"Journal of Systems Science & Complexity"},{"key":"280_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-49381-6_42","volume-title":"International Symposium on Algorithms and Computation","author":"S Hamaguchi","year":"1998","unstructured":"Hamaguchi S and Katoh N, A capacitated vehicle routing problem on a tree, International Symposium on Algorithms and Computation, Springer, Berlin, Heidelbarg, 1998, 399\u2013407."},{"issue":"3","key":"280_CR3","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s11424-018-7316-4","volume":"32","author":"T H Zhang","year":"2019","unstructured":"Zhang T H, Zhao F, Zhang J L, et al., An approximation of the customer waiting time for online restaurants owning delivery system, Journal of Systems Science & Complexity, 2019, 32(3): 907\u2013931.","journal-title":"Journal of Systems Science & Complexity"},{"issue":"1","key":"280_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig G and Ramser J, The truck dispatching problem, Management Science, 1959, 6(1): 80\u201391.","journal-title":"Management Science"},{"key":"280_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(87)90012-5","volume":"6","author":"K Altinkemer","year":"1987","unstructured":"Altinkemer K and Gavish B, Heuristics for unequal weight delivery problem with a fixed error guarantee, Operational Research Letters, 1987, 6: 149\u2013158.","journal-title":"Operational Research Letters"},{"key":"280_CR6","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/trsc.24.4.294","volume":"24","author":"K Altinkemer","year":"1990","unstructured":"Altinkemer K and Gavish B, Heuristics for delivery problems with constant error guarantees, Transportation Science, 1990, 24: 294\u2013297.","journal-title":"Transportation Science"},{"issue":"2","key":"280_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011461300596","volume":"5","author":"T Asano","year":"2001","unstructured":"Asano T, Katoh N, and Kawashima K, A new approximation algorithm for the capacitated vehicle routing problem on a tree, Journal of Combinatorial Optimization, 2001, 5(2): 213\u2013231.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"280_CR8","first-page":"3","volume":"116","author":"A Becker","year":"2018","unstructured":"Becker A, A tight 4\/3 approximation for capacitated vehicle routing in trees, Leibniz International Proceedings in Informatics, 2018, 116(1): 3\u201313.","journal-title":"Leibniz International Proceedings in Informatics"},{"issue":"4","key":"280_CR9","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/opre.39.4.616","volume":"39","author":"M Labb\u00e9","year":"1991","unstructured":"Labb\u00e9 M, Laporte G, and Mercure H, Capacitated vehicle routing on trees, Operations Research, 1991, 39(4): 616\u2013622.","journal-title":"Operations Research"},{"issue":"3","key":"280_CR10","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"G C Zhang","year":"2001","unstructured":"Zhang G C, Cai X Q, Lee C Y, et al., Minimizing makespan on a single batch processing machine with nonidentical job sizes, Naval Research Logistics, 2001, 48(3): 226\u2013240.","journal-title":"Naval Research Logistics"},{"issue":"5","key":"280_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/nav.21587","volume":"61","author":"G D\u00f3sa","year":"2014","unstructured":"D\u00f3sa G, Tan Z Y, Tuza Z, et al., Improve bounds for batch scheduling with nonidentical job sizes, Naval Research Logistics, 2014, 61(5): 351\u2013358.","journal-title":"Naval Research Logistics"},{"key":"280_CR12","unstructured":"D\u00f3sa G and Sgall J, First fit bin packing: A tight analysis, Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science (ed. by Portier N and Wilke T), Kiel, 2013."},{"key":"280_CR13","doi-asserted-by":"publisher","unstructured":"Wu Y X and Lu X W, Capacitated vehicle routing problem on line with unsplittable demands, Journal of Combinatorial Optimization, 2020, DOI: https:\/\/doi.org\/10.1007\/s10878-020-00565-5.","DOI":"10.1007\/s10878-020-00565-5"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-022-0280-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-022-0280-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-022-0280-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T09:32:52Z","timestamp":1666085572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-022-0280-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,20]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["280"],"URL":"https:\/\/doi.org\/10.1007\/s11424-022-0280-z","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,20]]},"assertion":[{"value":"5 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}