{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:28:45Z","timestamp":1766269725291},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11590-023-01992-z","type":"journal-article","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T14:03:39Z","timestamp":1678716219000},"page":"307-318","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation algorithms for the restricted k-Chinese postman problems with penalties"],"prefix":"10.1007","volume":"18","author":[{"given":"Pengxiang","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongtao","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"key":"1992_CR1","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1016\/j.ejor.2008.04.037","volume":"196","author":"J Ar\u00e1oz","year":"2009","unstructured":"Ar\u00e1oz, J., Fern\u00e1ndez, E., Meza, O.: Solving the prize-collecting rural postman problem. Eur. J. Oper. Res. 196, 886\u2013896 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1992_CR2","doi-asserted-by":"publisher","first-page":"3432","DOI":"10.1016\/j.cor.2005.02.013","volume":"33","author":"J Ar\u00e1oz","year":"2006","unstructured":"Ar\u00e1oz, J., Fern\u00e1ndez, E., Zoltan, C.: Privatized rural postman problems. Comput. Oper. Res. 33, 3432\u20133449 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"1992_CR3","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621\u2013636 (1989)","journal-title":"Networks"},{"key":"1992_CR4","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1002\/net.3230220706","volume":"22","author":"E Benavent","year":"1992","unstructured":"Benavent, E., Campos, V., Corber\u00e1n, A., Mota, E.: The capacitated arc routing problem: lower bounds. Networks 22, 669\u2013690 (1992)","journal-title":"Networks"},{"key":"1992_CR5","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413\u2013420 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"1992_CR6","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":"2","key":"1992_CR7","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"GN Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"key":"1992_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(83)90102-6","volume":"6","author":"AM Frieze","year":"1983","unstructured":"Frieze, A.M.: An extension of Christofides heuristic to the $$k$$-person travelling salesman problem. Discret. Appl. Math. 6, 79\u201383 (1983)","journal-title":"Discret. Appl. Math."},{"key":"1992_CR9","doi-asserted-by":"crossref","unstructured":"Glover, F., Klingman, D.: Finding minimum spanning trees with a fixed number of links at a node. In: Combinatorial Programming: Methods and Applications (Roy, B., Ed.), pp. 191\u2013201. Dondrecht-Holland (1975)","DOI":"10.1007\/978-94-011-7557-9_10"},{"key":"1992_CR10","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24, 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"1992_CR11","first-page":"263","volume":"10","author":"MG Guan","year":"1960","unstructured":"Guan, M.G.: Graphic programming using odd or even points (in Chinese). Acta Math. Sinica 10, 263\u2013266 (1960)","journal-title":"Acta Math. Sinica"},{"key":"1992_CR12","doi-asserted-by":"crossref","unstructured":"Karlin, A., Klein, N., Oveis Gharan, S.: A (slightly) improved approximation algorithm for metric TSP. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 32\u201345. Association for Computing Machinery, New York, USA (2021)","DOI":"10.1145\/3406325.3451009"},{"key":"1992_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2018","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2018)"},{"key":"1992_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6377(94)90073-6","volume":"16","author":"WL Pearn","year":"1994","unstructured":"Pearn, W.L.: Solvable cases of the $$k$$-person Chinese postman problem. Oper. Res. Lett. 16, 241\u2013244 (1994)","journal-title":"Oper. Res. Lett."},{"key":"1992_CR15","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"},{"key":"1992_CR16","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.orl.2021.10.002","volume":"49","author":"HT Zhu","year":"2021","unstructured":"Zhu, H.T., Pan, P.X.: The restricted Chinese postman problems with penalties. Oper. Res. Lett. 49, 851\u2013854 (2021)","journal-title":"Oper. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01992-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-01992-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01992-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T06:23:08Z","timestamp":1704867788000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-01992-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,13]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1992"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-01992-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,13]]},"assertion":[{"value":"4 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}