{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:36:12Z","timestamp":1768912572944,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12361066"],"award-info":[{"award-number":["12361066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12101593"],"award-info":[{"award-number":["12101593"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Postgraduate Research and Innovation Foundation of Yunnan University","award":["KC-22221167"],"award-info":[{"award-number":["KC-22221167"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["buctrc202219"],"award-info":[{"award-number":["buctrc202219"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Yunling Scholars Training of Yunnan Province","award":["K264202011820"],"award-info":[{"award-number":["K264202011820"]}]},{"name":"Project of Yunling Scholars Training of Yunnan Province","award":["K264202011820"],"award-info":[{"award-number":["K264202011820"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12361066"],"award-info":[{"award-number":["12361066"]}],"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":[[2024,10]]},"DOI":"10.1007\/s10878-024-01216-9","type":"journal-article","created":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T17:01:33Z","timestamp":1728320493000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation algorithms for solving the trip-constrained vehicle routing cover problems"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1508-1440","authenticated-orcid":false,"given":"Jianping","family":"Li","sequence":"first","affiliation":[]},{"given":"Ping","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[]},{"given":"Pengxiang","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,7]]},"reference":[{"issue":"2","key":"1216_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1287\/ijoc.14.2.132.118","volume":"14","author":"D Applegate","year":"2002","unstructured":"Applegate D, Cook W, Dash S, Rohe A (2002) Solution of a min-max vehicle routing problem. INFORMS J Comput 14(2):132\u2013143. https:\/\/doi.org\/10.1287\/ijoc.14.2.132.118","journal-title":"INFORMS J Comput"},{"issue":"1","key":"1216_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","volume":"59","author":"EM Arkin","year":"2006","unstructured":"Arkin EM, Hassin R, Levin A (2006) Approximations for minimum and min-max vehicle routing problems. J Algorithms 59(1):1\u201318. https:\/\/doi.org\/10.1016\/j.jalgor.2005.01.007","journal-title":"J Algorithms"},{"issue":"2","key":"1216_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell AM, Vandenbussche D, Hermann W (2008) Routing for relief efforts. Transp Sci 42(2):127\u2013145. https:\/\/doi.org\/10.1287\/trsc.1070.0209","journal-title":"Transp Sci"},{"key":"1216_CR4","first-page":"31","volume":"55","author":"J Carlsson","year":"2009","unstructured":"Carlsson J, Ge D, Subramaniam A, Wu A, Ye Y (2009) Solving min-max multi-depot vehicle routing problem. Lectures Global Optim 55:31\u201346","journal-title":"Lectures Global Optim"},{"key":"1216_CR5","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388. Carnegie Mellon University, Graduate School of Industrial Administration"},{"issue":"2","key":"1216_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"GN Frederickson","year":"1978","unstructured":"Frederickson GN, Hecht MS, Kim CE (1978) Approximation algorithms for some routing problems. SIAM J Comput 7(2):178\u2013193. https:\/\/doi.org\/10.1137\/0207017","journal-title":"SIAM J Comput"},{"key":"1216_CR7","unstructured":"Jorati A (2013) Approximation algorithms for some min-max vehicle routing problems, University of Alberta (Dissertation)"},{"issue":"2","key":"1216_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00453-012-9740-5","volume":"69","author":"MR Khani","year":"2014","unstructured":"Khani MR, Salavatipour MR (2014) Improved approximation algorithms for the min-max tree cover and bounded tree cover problems. Algorithmica 69(2):443\u2013460. https:\/\/doi.org\/10.1007\/s00453-012-9740-5","journal-title":"Algorithmica"},{"key":"1216_CR9","doi-asserted-by":"publisher","unstructured":"Korte B, Vygen J (2018) Combinatorial Optimization: Theory and Algorithms (the Sixth Edition), Springer, Berlin, https:\/\/doi.org\/10.1007\/978-3-662-56039-6","DOI":"10.1007\/978-3-662-56039-6"},{"key":"1216_CR10","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.tcs.2022.11.009","volume":"940","author":"JK Li","year":"2023","unstructured":"Li JK, Zhang P (2023) New approximation algorithms for the rooted budgeted cycle cover problem. Theoret Comput Sci 940:283\u2013295. https:\/\/doi.org\/10.1016\/j.tcs.2022.11.009","journal-title":"Theoret Comput Sci"},{"key":"1216_CR11","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10107-021-01678-3","volume":"192","author":"V Traub","year":"2022","unstructured":"Traub V, Tr\u00f6bst T (2022) A fast ($$2 + \\frac{2}{7}$$)-approximation algorithm for capacitated cycle covering. Math Program 192:497\u2013518. https:\/\/doi.org\/10.1007\/s10107-021-01678-3","journal-title":"Math Program"},{"key":"1216_CR12","doi-asserted-by":"publisher","unstructured":"Vazirani VV (2001) Approximation Algorithms. Springer. https:\/\/doi.org\/10.1007\/978-3-662-04565-7","DOI":"10.1007\/978-3-662-04565-7"},{"key":"1216_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson DP, Shmoys DB (2011) The Design of Approximation Algorithms. Cambridge University Press, Cambridge"},{"issue":"3","key":"1216_CR14","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TC.2013.2295609","volume":"64","author":"W Xu","year":"2015","unstructured":"Xu W, Liang W, Lin X (2015) Approximation algorithms for min-max cycle cover problems. IEEE Trans Comput 64(3):600\u2013613. https:\/\/doi.org\/10.1109\/TC.2013.2295609","journal-title":"IEEE Trans Comput"},{"issue":"8","key":"1216_CR15","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1002\/nav.20434","volume":"57","author":"Z Xu","year":"2010","unstructured":"Xu Z, Xu L, Li C-L (2010) Approximation results for min-max path cover problems in vehicle routing. Naval Res Log 57(8):728\u2013748. https:\/\/doi.org\/10.1002\/nav.20434","journal-title":"Naval Res Log"},{"issue":"3","key":"1216_CR16","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.dam.2011.09.014","volume":"160","author":"Z Xu","year":"2012","unstructured":"Xu Z, Xu D, Zhu W (2012) Approximation results for a min-max location-routing problem. Discret Appl Math 160(3):306\u2013320. https:\/\/doi.org\/10.1016\/j.dam.2011.09.014","journal-title":"Discret Appl Math"},{"key":"1216_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2016.01.041","volume":"654","author":"W Yu","year":"2016","unstructured":"Yu W, Liu Z (2016) Improved approximation algorithms for some min-max and minimum cycle cover problems. Theoret Comput Sci 654:45\u201358. https:\/\/doi.org\/10.1016\/j.tcs.2016.01.041","journal-title":"Theoret Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01216-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01216-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01216-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T19:09:51Z","timestamp":1729192191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01216-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1216"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01216-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10]]},"assertion":[{"value":"22 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"21"}}