PTAS for Euclidean travelling salesman problem with soft time windows
- 19 January 2026
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 51 (2) , 13
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of Xiamen, China (3502Z202373007)
- Natural Science Foundation of Jiujiang, China (S2024KXJJ0001)
- Fundamental Research Funds for the Central Universities of China (20720190028)
- China Scholarship Council
This publication has 29 references indexed in Scilit:
- Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands2022
- PTAS for the Euclidean Capacitated Vehicle Routing Problem in $R^d$2016
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem2015
- An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity StructureAlgorithmica, 2015
- The Parameterized Complexity of Local Search for TSP, More RefinedAlgorithmica, 2012
- Design and Analysis of Approximation Algorithms2012
- A branch & cut algorithm for the windy general routing problem and special casesNetworks, 2007
- Algorithms for the On-Line Travelling Salesman1Algorithmica, 2001
- A cutting plane algorithm for the General Routing ProblemMathematical Programming, 2001
- A fundamental problem in vehicle routingNetworks, 1974