{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T01:35:17Z","timestamp":1747445717046,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T00:00:00Z","timestamp":1586304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T00:00:00Z","timestamp":1586304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871213","71431004"],"award-info":[{"award-number":["11871213","71431004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00565-5","type":"journal-article","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T11:02:39Z","timestamp":1586343759000},"page":"1953-1963","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Capacitated vehicle routing problem on line with unsplittable demands"],"prefix":"10.1007","volume":"44","author":[{"given":"Yuanxiao","family":"Wu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4728-6048","authenticated-orcid":false,"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,8]]},"reference":[{"key":"565_CR1","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/trsc.24.4.294","volume":"24","author":"K Altinkemer","year":"1990","unstructured":"Altinkemer K, Gavish B (1990) Heuristics for delivery problems with constant error guarantees. Transp Sci 24:294\u2013297","journal-title":"Transp Sci"},{"issue":"2","key":"565_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011461300596","volume":"5","author":"T Asano","year":"2001","unstructured":"Asano T, Katoh N, Kawashima K (2001) A new approximation algorithm for the capacitated vehicle routing problem on a tree. J Comb Optim 5(2):213\u2013231","journal-title":"J Comb Optim"},{"issue":"1","key":"565_CR3","first-page":"3","volume":"116","author":"A Becker","year":"2018","unstructured":"Becker A (2018) A tight 4\/3 approximation for capacitated vehicle routing in trees. Leibniz Int Proc Inform 116(1):3","journal-title":"Leibniz Int Proc Inform"},{"key":"565_CR4","unstructured":"D\u00f3sa G, Sgall J (2013) First Fit bin packing: a tight analysis. In: Proceedings of the $$30$$th symposium on theoretical aspects of computer science, Kiel"},{"issue":"5","key":"565_CR5","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 ZY, Tuza Z, Yan YJ, L\u00e1nyi CS (2014) Improve bounds for batch scheduling with nonidentical job sizes. Naval Res Logist 61(5):351\u2013358","journal-title":"Naval Res Logist"},{"issue":"4","key":"565_CR6","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M Haimovich","year":"1985","unstructured":"Haimovich M (1985) Bounds and heuristics for capacitated routing problems. Math Oper Res 10(4):527\u2013542","journal-title":"Math Oper Res"},{"key":"565_CR7","doi-asserted-by":"crossref","unstructured":"Hamaguchi S, Katoh N (1998) A capacitated vehicle routing problem on a tree. In: International symposium on algorithms and computation, pp 399\u2013407","DOI":"10.1007\/3-540-49381-6_42"},{"issue":"4","key":"565_CR8","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, Mercure H (1991) Capacitated vehicle routing on trees. Oper Res 39(4):616\u2013622","journal-title":"Oper Res"},{"key":"565_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01720015","volume":"5","author":"G Laporte","year":"1983","unstructured":"Laporte G, Nobert Y (1983) A branch and bound algorithm for the capacitated vehicle routing problem. OR Spektrum 5:77\u201385","journal-title":"OR Spektrum"},{"issue":"3","key":"565_CR10","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"GC Zhang","year":"2001","unstructured":"Zhang GC, Cai XQ, Lee CY, Wong CK (2001) Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Res Logist 48(3):226\u2013240","journal-title":"Naval Res Logist"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00565-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00565-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00565-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:48:14Z","timestamp":1664354894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00565-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,8]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["565"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00565-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,4,8]]},"assertion":[{"value":"8 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}