{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:48:23Z","timestamp":1774727303816,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:00:00Z","timestamp":1768780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:00:00Z","timestamp":1768780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Natural Science Foundation of Xiamen, China","award":["3502Z202373007"],"award-info":[{"award-number":["3502Z202373007"]}]},{"name":"Natural Science Foundation of Jiujiang, China","award":["S2024KXJJ0001"],"award-info":[{"award-number":["S2024KXJJ0001"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities of China","doi-asserted-by":"crossref","award":["20720190028"],"award-info":[{"award-number":["20720190028"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10878-025-01387-z","type":"journal-article","created":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T15:54:37Z","timestamp":1768838077000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PTAS for Euclidean travelling salesman problem with soft time windows"],"prefix":"10.1007","volume":"51","author":[{"given":"Liang","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songsong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongxuan","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunyan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,19]]},"reference":[{"key":"1387_CR1","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM 45:753\u2013782","journal-title":"J ACM"},{"key":"1387_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10107-003-0438-y","volume":"97","author":"S Arora","year":"2003","unstructured":"Arora S (2003) Approximation schemes for NP-hard geometric optimization problems: a survey. Math Program 97:43\u201369","journal-title":"Math Program"},{"key":"1387_CR3","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G Ausiello","year":"2001","unstructured":"Ausiello G, Feuerstein E, Leonardi S, Stougie L, Talamo M (2001) Algorithms for the on-line travelling salesman. Algorithmica 29:560\u2013581","journal-title":"Algorithmica"},{"key":"1387_CR4","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59:1269\u20131283","journal-title":"Oper Res"},{"key":"1387_CR5","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/s10878-024-01190-2","volume":"47","author":"X Bao","year":"2024","unstructured":"Bao X, Ni X (2024) Approximation algorithms for two clustered arc routing problems. J Comb Optim 47:88","journal-title":"J Comb Optim"},{"key":"1387_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-022-01841-4","volume":"197","author":"J Blauth","year":"2023","unstructured":"Blauth J, Traub V, Vygen J (2023) Improving the approximation ratio for capacitated vehicle routing. Math Program 197:451\u2013497","journal-title":"Math Program"},{"key":"1387_CR7","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. rep., Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA"},{"key":"1387_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/PL00011426","volume":"90","author":"A Corber\u00e1n","year":"2001","unstructured":"Corber\u00e1n A, Letchford A, Sanchis J (2001) A cutting plane algorithm for the general routing problem. Math Program 90:291\u2013316","journal-title":"Math Program"},{"issue":"4","key":"1387_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/net.20176","volume":"49","author":"A Corber\u00e1n","year":"2007","unstructured":"Corber\u00e1n A, Plana I, Sanchis J (2007) A branch and cut algorithm for the windy general routing problem and special cases. Networks 49(4):245\u2013257","journal-title":"Networks"},{"key":"1387_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig G, Ramser J (1959) The truck dispatching problem. Manage Sci 6:80\u201391","journal-title":"Manage Sci"},{"key":"1387_CR11","doi-asserted-by":"crossref","unstructured":"Das A, Mathieu C (2009) A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. In: Proceedings of The Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA","DOI":"10.1137\/1.9781611973075.33"},{"key":"1387_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1701-9","volume-title":"Design and analysis of approximation algorithms","author":"D Du","year":"2012","unstructured":"Du D, Ko K, Hu X (2012) Design and analysis of approximation algorithms. Springer, Cham"},{"key":"1387_CR13","doi-asserted-by":"crossref","unstructured":"Friggstad Z, Mousavi R, Rahgoshay M, Salavatipour MR (2022) Improved approximations for capacitated vehicle routing with unsplittable client demands. In: Proceedings of International Conference on Integer Programming and Combinatorial Optimization, Springer, pp 251\u2013261","DOI":"10.1007\/978-3-031-06901-7_19"},{"issue":"3","key":"1387_CR14","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M Garey","year":"1978","unstructured":"Garey M, Johnson D (1978) \u201cStrong\u2019\u2019 NP-completeness results: motivation, examples and implications. J ACM 25(3):499\u2013508","journal-title":"J ACM"},{"key":"1387_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00453-012-9685-8","volume":"67","author":"J Guo","year":"2013","unstructured":"Guo J, Hartung S, Niedermeier R, Such\u00fd O (2013) The parameterized complexity of local search for TSP, more refined. Algorithmica 67:89\u2013110","journal-title":"Algorithmica"},{"issue":"4","key":"1387_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3402926","volume":"17","author":"A Hyung-Chan","year":"2021","unstructured":"Hyung-Chan A, Kleinberg R, Shmoys D (2021) Approximation algorithms for the bottleneck asymmetric traveling salesman problem. ACM Trans Algorithms 17(4):1\u201312","journal-title":"ACM Trans Algorithms"},{"key":"1387_CR17","unstructured":"Karlin R, Klein N, Gharan S (2023) A (slightly) improved approximation algorithm for metric TSP. Operations Research Articles in Advance (Online):1\u201353"},{"key":"1387_CR18","doi-asserted-by":"crossref","unstructured":"Khachay M, Dubinin R (2016) PTAS for the Euclidean capacitated vehicle routing problem in $${R}^d$$. In: Proceedings of Conference on Discrete Optimization and Operations Research, pp 193\u2013205","DOI":"10.1007\/978-3-319-44914-2_16"},{"key":"1387_CR19","doi-asserted-by":"crossref","unstructured":"Khachay M, Zaytseva H (2015) Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem. In: Proceedings of Conference on Combinatorial Optimization and Applications, pp 178\u2013190","DOI":"10.1007\/978-3-319-26626-8_14"},{"key":"1387_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P Lacomme","year":"2004","unstructured":"Lacomme P, Prins C, Ramdane-Ch\u00e9rif W (2004) Competitive memetic algorithms for arc routing problems. Ann Oper Res 131:159\u2013185","journal-title":"Ann Oper Res"},{"key":"1387_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10878-024-01216-9","volume":"487","author":"J Li","year":"2024","unstructured":"Li J, Yang P, Lichen J, Pan P (2024) Approximation algorithms for solving the trip-constrained vehicle routing cover problems. J Comb Optim 487:21","journal-title":"J Comb Optim"},{"key":"1387_CR22","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1016\/j.cor.2010.10.019","volume":"38","author":"S Lorini","year":"2011","unstructured":"Lorini S, Potvin J, Zufferey N (2011) Online vehicle routing and scheduling with dynamic travel times. Comput Oper Res 38:1086\u20131090","journal-title":"Comput Oper Res"},{"key":"1387_CR23","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C Orloff","year":"1974","unstructured":"Orloff C, Potvin J, Zufferey N (1974) A fundamental problem in vehicle routing. Networks 4:35\u201364","journal-title":"Networks"},{"issue":"5","key":"1387_CR24","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0305-0548(94)00035-7","volume":"22","author":"R Pandit","year":"1975","unstructured":"Pandit R, Muralidharan B (1975) A capacitated general routing problem on mixed networks. Comput Oper Res 22(5):465\u2013478","journal-title":"Comput Oper Res"},{"key":"1387_CR25","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1007\/s10878-015-9931-5","volume":"32","author":"L Song","year":"2016","unstructured":"Song L, Huang H, Du H (2016) Approximation schemes for Euclidean vehicle routing problems with time windows. J Comb Optim 32:1217\u20131231","journal-title":"J Comb Optim"},{"key":"1387_CR26","first-page":"1","volume":"28","author":"J Sousaa","year":"2011","unstructured":"Sousaa J, Biswasa H, Britob R, Silveirab A (2011) A multi objective approach to solve capacitated vehicle routing problems with time windows using mixed integer linear programming. Int J Adv Sci Technol 28:1\u20138","journal-title":"Int J Adv Sci Technol"},{"key":"1387_CR27","doi-asserted-by":"publisher","first-page":"52","DOI":"10.12720\/jtle.2.1.52-58","volume":"2","author":"N Toklu","year":"2014","unstructured":"Toklu N, Gambardella L, Montemanni R (2014) A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times. J Traffic Logist Eng 2:52\u201358","journal-title":"J Traffic Logist Eng"},{"key":"1387_CR28","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2001) The vehicle routing problem. Society for Industrial and Applied Mathematics","DOI":"10.1137\/1.9780898718515"},{"issue":"4","key":"1387_CR29","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, Shmoys D (2022) A fast (2 + 2\/7)-approximation algorithm for capacitated cycle covering. Math Program 192(4):497\u2013518","journal-title":"Math Program"},{"key":"1387_CR30","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s00453-015-9970-4","volume":"74","author":"M Xiao","year":"2016","unstructured":"Xiao M, Nagamochi H (2016) An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure. Algorithmica 74:713\u2013741","journal-title":"Algorithmica"},{"issue":"4","key":"1387_CR31","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s10878-023-01029-2","volume":"45","author":"J Zhang","year":"2023","unstructured":"Zhang J, Gao S, Hou B, Liu W (2023) An approximation algorithm for the clustered path travelling salesman problem. J Comb Optim 45(4):104","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01387-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01387-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01387-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:59:47Z","timestamp":1774724387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01387-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,19]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1387"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01387-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,19]]},"assertion":[{"value":"25 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2026","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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}}],"article-number":"13"}}