{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:16:10Z","timestamp":1780380970024,"version":"3.54.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"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"}]},{"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"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10898-024-01420-1","type":"journal-article","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T09:01:54Z","timestamp":1721638914000},"page":"965-982","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5713-0867","authenticated-orcid":false,"given":"Pengxiang","family":"Pan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1508-1440","authenticated-orcid":false,"given":"Jianping","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,22]]},"reference":[{"issue":"3","key":"1420_CR1","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1016\/j.ejor.2019.01.056","volume":"276","author":"E Benavent","year":"2019","unstructured":"Benavent, E., Corber\u00e1n, \u00c1., Lagan\u00e0, D., Vocaturo, F.: The periodic rural postman problem with irregular services on mixed graphs. Eur. J. Oper. Res. 276(3), 826\u2013839 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1420_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.07.026","volume":"257","author":"M Colombi","year":"2017","unstructured":"Colombi, M., Corber\u00e1n, \u00c1., Mansini, R., Plana, I., Sanchis, J.M.: The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm. Eur. J. Oper. Res. 257(1), 1\u201312 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1420_CR3","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.ejor.2015.01.042","volume":"244","author":"M Constantino","year":"2015","unstructured":"Constantino, M., Gouveia, L., Mour\u0101o, M.C., Nunes, A.C.: The mixed capacitated arc routing problem with non-overlapping routes. Eur. J. Oper. Res. 244(2), 445\u2013456 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1420_CR4","doi-asserted-by":"crossref","unstructured":"Corber\u00e1n, A., Laporte, G.: Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization (Vol. 20). Society for Industrial and Applied Mathematics, Philadelphia (2014)","DOI":"10.1137\/1.9781611973679"},{"issue":"1","key":"1420_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ejor.2014.04.039","volume":"239","author":"HL Ding","year":"2014","unstructured":"Ding, H.L., Li, J.P., Lih, K.W.: Approximation algorithms for solving the constrained arc routing problem in mixed graphs. Eur. J. Oper. Res. 239(1), 80\u201388 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"1420_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with (0,1) vertices. J. Res. Natl. Bur. Stand. B 69, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bur. Stand. B"},{"key":"1420_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248\u2013264 (1972)","journal-title":"J. ACM"},{"issue":"1","key":"1420_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5(1), 88\u2013124 (1973)","journal-title":"Math. Program."},{"issue":"3","key":"1420_CR9","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"GN Frederickson","year":"1979","unstructured":"Frederickson, G.N.: Approximation algorithms for some postman problems. J. ACM 26(3), 538\u2013554 (1979)","journal-title":"J. ACM"},{"key":"1420_CR10","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)"},{"issue":"4","key":"1420_CR11","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1002\/net.10030","volume":"39","author":"M Ghodsi","year":"2002","unstructured":"Ghodsi, M., Hajiaghayi, M.T., Mahdian, M., Mirrokni, V.S.: Length-constrained path-matchings in graphs. Networks 39(4), 210\u2013215 (2002)","journal-title":"Networks"},{"key":"1420_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"B Golden","year":"2008","unstructured":"Golden, B., Raghavan, S., Wasil, E.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, Berlin (2008)"},{"key":"1420_CR13","first-page":"263","volume":"10","author":"MG Guan","year":"1960","unstructured":"Guan, M.G.: Graphic programming using odd and even points (in Chinese). Acta Math. Sinica 10, 263\u2013266 (1960)","journal-title":"Acta Math. Sinica"},{"key":"1420_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization: Theory and Algorithms (the Sixth Edition)","author":"B Korte","year":"2018","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms (the Sixth Edition). Springer, Berlin (2018)"},{"key":"1420_CR15","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2001)","DOI":"10.1137\/1.9780898718515"},{"issue":"3","key":"1420_CR16","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1145\/321958.321974","volume":"23","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: On the complexity of edge traversing. J. ACM 23(3), 544\u2013554 (1976)","journal-title":"J. ACM"},{"issue":"4","key":"1420_CR17","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1137\/S0895480197331454","volume":"12","author":"B Raghavachari","year":"1999","unstructured":"Raghavachari, B., Veerasamy, J.: A 3\/2-approximation algorithm for the mixed postman problem. SIAM J. Discret. Math. 12(4), 425\u2013433 (1999)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01420-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01420-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01420-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:02:25Z","timestamp":1730296945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01420-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,22]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1420"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01420-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,22]]},"assertion":[{"value":"18 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"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"}}]}}