{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:40:22Z","timestamp":1767318022042,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819548385","type":"print"},{"value":"9789819548392","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-4839-2_23","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:37:21Z","timestamp":1767317841000},"page":"292-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Windy k-Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Jianping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxiao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runtao","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1287\/opre.2017.1603","volume":"65","author":"A Asadpour","year":"2017","unstructured":"Asadpour, A., Goemans, M.X., Madry, A., Gharan, S.O., Saberi, A.: An $$O(\\log n\/\\log \\log n)$$-approximation algorithm for the asymmetric traveling salesman problem. Oper. Res. 65(4), 1043\u20131061 (2017)","journal-title":"Oper. Res."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications (2 edn). Springer Monographs in Mathematics (2010)","DOI":"10.1007\/978-1-84800-998-1"},{"key":"23_CR3","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Carnegie Mellon University (1976)"},{"key":"23_CR4","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":"23_CR5","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, 88\u2013124 (1973)","journal-title":"Math. Program."},{"issue":"2","key":"23_CR6","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":"23_CR7","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."},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.3230120103","volume":"12","author":"AM Frieze","year":"1982","unstructured":"Frieze, A.M., Galbiati, G., Maffioli, F.: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12(1), 23\u201339 (1982)","journal-title":"Networks"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F Glover","year":"2001","unstructured":"Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction heuristics for the asymmetric TSP. Eur. J. Oper. Res. 129(3), 555\u2013568 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR10","first-page":"237","volume":"1","author":"MG Guan","year":"1962","unstructured":"Guan, M.G.: Graphic programming using odd or even points. Chin. Math. 1, 237\u2013277 (1962)","journal-title":"Chin. Math."},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0166-218X(84)90089-1","volume":"9","author":"MG Guan","year":"1984","unstructured":"Guan, M.G.: On the windy postman problem. Discret. Appl. Math. 9(1), 41\u201346 (1984)","journal-title":"Discret. Appl. Math."},{"key":"23_CR12","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"BH Korte","year":"2011","unstructured":"Korte, B.H., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2011)"},{"issue":"7","key":"23_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/mnsc.25.7.643","volume":"25","author":"E Minieka","year":"1979","unstructured":"Minieka, E.: The Chinese postman problem for mixed networks. Manag. Sci. 25(7), 643\u2013648 (1979)","journal-title":"Manag. Sci."},{"issue":"4","key":"23_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(4), 241\u2013244 (1994)","journal-title":"Oper. Res. Lett."},{"key":"23_CR15","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"G Reinelt","year":"2003","unstructured":"Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer, Berlin (2003)"},{"key":"23_CR16","unstructured":"Schrijver, A.: Combinatorial Optimization: polyhedra and efficiency (Volume A-C), Algorithms and Combinatorics, vol\u00a024. Springer (2004)"},{"issue":"6","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3424306","volume":"67","author":"O Svensson","year":"2020","unstructured":"Svensson, O., Tarnawski, J., V\u00e9gh, L.A.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. J. ACM 67(6), 1\u201353 (2020)","journal-title":"J. ACM"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01587080","volume":"44","author":"Z Win","year":"1989","unstructured":"Win, Z.: On the windy postman problem on Eulerian graphs. Math. Program. 44, 97\u2013112 (1989)","journal-title":"Math. Program."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10479-021-03933-4","volume":"300","author":"W Yu","year":"2021","unstructured":"Yu, W., Liu, Z., Bao, X.: Approximation algorithms for some min-max postmen cover problems. Ann. Oper. Res. 300, 267\u2013287 (2021)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4839-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:37:22Z","timestamp":1767317842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4839-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819548385","9789819548392"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4839-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.maths.sdnu.edu.cn\/TAMC2025.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}