{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T13:02:06Z","timestamp":1772888526614,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T00:00:00Z","timestamp":1669334400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T00:00:00Z","timestamp":1669334400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11861075"],"award-info":[{"award-number":["11861075"]}],"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":"publisher","award":["12101593"],"award-info":[{"award-number":["12101593"]}],"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":"publisher","award":["11861075"],"award-info":[{"award-number":["11861075"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project for Innovation Team (Cultivation) of Yunnan Province","award":["202005AE160006"],"award-info":[{"award-number":["202005AE160006"]}]},{"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10878-022-00931-5","type":"journal-article","created":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T09:12:11Z","timestamp":1669367531000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximation algorithms for solving the heterogeneous Chinese postman problem"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1508-1440","authenticated-orcid":false,"given":"Jianping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengxiang","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijian","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wencheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suding","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,25]]},"reference":[{"issue":"6","key":"931_CR1","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s11590-015-0924-1","volume":"10","author":"J Bae","year":"2016","unstructured":"Bae J, Rathinam S (2016) A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem. Optim Lett 10(6):1269\u20131285","journal-title":"Optim Lett"},{"key":"931_CR2","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University"},{"issue":"1","key":"931_CR3","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds J, Johnson EL (1973) Matching, Euler tours and the Chinese postman. Math Program 5(1):88\u2013124","journal-title":"Math Program"},{"issue":"2","key":"931_CR4","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","journal-title":"SIAM J Comput"},{"key":"931_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"BL Golden","year":"2008","unstructured":"Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges. Springer, New York"},{"issue":"1","key":"931_CR6","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/moor.2015.0729","volume":"41","author":"I G\u00f8rtz","year":"2016","unstructured":"G\u00f8rtz I, Molinaro M, Nagarajan V, Ravi R (2016) Capacitated vehicle routing with nonuniform speeds. Math Oper Res 41(1):318\u2013331","journal-title":"Math Oper Res"},{"key":"931_CR7","unstructured":"Guan MG (1960) Graphic programming using odd or even points (in chinese). Acta Math Sin 10:263\u2013266. English translation: Chinese Mathematics 1, 1962, 273\u2013277"},{"key":"931_CR8","doi-asserted-by":"crossref","unstructured":"Karlin A, Klein N, Oveis Gharan S (2021) A (slightly) improved approximation algorithm for metric TSP. In: In: Proceedings of the 53rd Annual ACM IGACT Symposium on Theory of Computing (STOC), ACM, Association for Computing Machinery, New York, USA, pp 32\u201345","DOI":"10.1145\/3406325.3451009"},{"key":"931_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial optimization: theory and algorithms","author":"B Korte","year":"2012","unstructured":"Korte B, Vygen J (2012) Combinatorial optimization: theory and algorithms. Springer"},{"key":"931_CR10","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43:408\u2013416","journal-title":"Transp Sci"},{"key":"931_CR11","doi-asserted-by":"crossref","unstructured":"Li JP, Cai LJ, Lichen JR, Pan PX, Wang WC, Liu SD (2021) An approximation algorithm for solving the heterogeneous Chinese postman problem. In: The 15th International Conference on Algorithmic Aspects in Information and Management (AAIM 2021), Springer, LNCS\u00a013153, pp 38\u201346","DOI":"10.1007\/978-3-030-93176-6_4"},{"issue":"3","key":"931_CR12","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1109\/TCNS.2020.2983791","volume":"7","author":"A Prasad","year":"2020","unstructured":"Prasad A, Choi HL, Sundaram S (2020) Min-max tours and paths for task allocation to heterogeneous agents. IEEE Trans Control Netw Syst 7(3):1511\u20131522","journal-title":"IEEE Trans Control Netw Syst"},{"key":"931_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle routing: problems, methods and applications","author":"P Toth","year":"2014","unstructured":"Toth P, Vigo D (2014) Vehicle routing: problems, methods and applications. MOS-SIAM, Philadelphia"},{"key":"931_CR14","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, Berlin"},{"issue":"1","key":"931_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11590-010-0256-0","volume":"6","author":"S Yadlapalli","year":"2012","unstructured":"Yadlapalli S, Rathinam S, Darbha S (2012) 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem. Optim Lett 6(1):141\u2013152","journal-title":"Optim Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00931-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00931-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00931-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T07:46:47Z","timestamp":1675496807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00931-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,25]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["931"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00931-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,25]]},"assertion":[{"value":"28 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2022","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"17"}}