{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:56Z","timestamp":1740122396769,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:00:00Z","timestamp":1558310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:00:00Z","timestamp":1558310400000},"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"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11371137"],"award-info":[{"award-number":["11371137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10878-019-00420-2","type":"journal-article","created":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T09:32:35Z","timestamp":1558431155000},"page":"565-580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved algorithms for single vehicle scheduling on tree\/cycle networks"],"prefix":"10.1007","volume":"42","author":[{"given":"Yuanxiao","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4728-6048","authenticated-orcid":false,"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,20]]},"reference":[{"key":"420_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2004.05.013","volume":"324","author":"JE Augustine","year":"2004","unstructured":"Augustine JE, Seiden SS (2004) Linear time approximation schemes for vehicle scheduling problems. Theor Comput Sci 324:147\u2013160","journal-title":"Theor Comput Sci"},{"key":"420_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.01.046","volume":"434","author":"X Bao","year":"2012","unstructured":"Bao X, Liu Z (2012) Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theor Comput Sci 434:1\u201310","journal-title":"Theor Comput Sci"},{"key":"420_CR3","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-17514-5_17","volume":"6507","author":"B Bhattacharya","year":"2010","unstructured":"Bhattacharya B, Hu Y (2010) Approximation algorithms for the muti-vehicle scheduling problems. Lect Notes Comput Sci 6507:192\u2013205","journal-title":"Lect Notes Comput Sci"},{"key":"420_CR4","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/978-3-540-92182-0_70","volume":"5369","author":"B Bhattacharya","year":"2008","unstructured":"Bhattacharya B, Carmi P, Hu Y, Shi Q (2008) Single vehicle scheduling problems on path\/tree\/cycle networks with release and handling times. Lect Notes Comput Sci 5369:800\u2013811","journal-title":"Lect Notes Comput Sci"},{"key":"420_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0020-0190(02)00474-X","volume":"86","author":"DR Gaur","year":"2003","unstructured":"Gaur DR, Gupta A, Krishnamurti R (2003) A $$\\frac{5}{3}$$-approximation algorithm for scheduling vehicles on a path with release and handling times. Inf Process Lett 86:87\u201391","journal-title":"Inf Process Lett"},{"key":"420_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S0166-218X(02)00596-6","volume":"129","author":"Y Karuno","year":"2003","unstructured":"Karuno Y, Nagamochi H (2003) $$2$$-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Discrete Appl Math 129:433\u2013447","journal-title":"Discrete Appl Math"},{"key":"420_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1018928911513","volume":"69","author":"Y Karuno","year":"1997","unstructured":"Karuno Y, Nagamochi H, Ibaraki T (1997) Vehicle scheduling on a tree with release and handling times. Ann Oper Res 69:193\u2013207","journal-title":"Ann Oper Res"},{"issue":"4","key":"420_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/net.10028","volume":"39","author":"Y Karuno","year":"2002","unstructured":"Karuno Y, Nagamochi H, Ibaraki T (2002) Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39(4):203\u2013209","journal-title":"Networks"},{"key":"420_CR9","first-page":"256","volume":"35","author":"H Nagamochi","year":"1997","unstructured":"Nagamochi H, Mochizuki K, Ibaraki T (1997) Complexity of the single vehicle scheduling problem on graphs. Inf Syst Oper Res 35:256\u2013276","journal-title":"Inf Syst Oper Res"},{"key":"420_CR10","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/mnsc.36.2.212","volume":"36","author":"HN Psaraftis","year":"1990","unstructured":"Psaraftis HN, Solomon MM, Magnanti TL, Kim T-U (1990) Routing and scheduling on a shoreline with release times. Manag Sci 36:212\u2013223","journal-title":"Manag Sci"},{"key":"420_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis JN (1992) Special cases of traveling salesman and repairman problems with time windows. Networks 22:263\u2013282","journal-title":"Networks"},{"key":"420_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.orl.2008.10.006","volume":"37","author":"W Yu","year":"2009","unstructured":"Yu W, Liu Z (2009) Vehicle routing problems on a line-shaped network with release time constraints. Oper Res Lett 37:85\u201388","journal-title":"Oper Res Lett"},{"key":"420_CR13","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1002\/net.20393","volume":"57","author":"W Yu","year":"2011","unstructured":"Yu W, Liu Z (2011) Single vehicle scheduling problems with release and service times on a line. Networks 57:128\u2013134","journal-title":"Networks"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00420-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-019-00420-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00420-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T06:31:11Z","timestamp":1635575471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-019-00420-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,20]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["420"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00420-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,5,20]]},"assertion":[{"value":"20 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}