Vehicle routing with time windows
Operations Research
Integer and combinatorial optimization
Integer and combinatorial optimization
A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
On the distance constrained vehicle routing problem
Operations Research
A convex relaxation for the asymmetric TSP
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the parsimonious property of connectivity problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Orienteering and Discounted-Reward TSP
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved algorithms for orienteering and related problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Asymmetric traveling salesman path and directed latency problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for the directed k-tour and k-stroll problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved algorithms for orienteering and related problems
ACM Transactions on Algorithms (TALG)
An improved integrality gap for asymmetric TSP paths
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
This paper studies vehicle routing problems on asymmetric metrics. Our starting point is the directed k-TSPproblem: given an asymmetric metric (V,d), a root r茂戮驴 Vand a target k≤ |V|, compute the minimum length tour that contains rand at least kother vertices. We present a polynomial time O(log2n·logk)-approximation algorithm for this problem. We use this algorithm for directed k-TSP to obtain an O(log2n)-approximation algorithm for the directed orienteeringproblem. This answers positively, the question of poly-logarithmic approximability of directed orienteering, an open problem from Blum et al.[2]. The previously best known results were quasi-polynomial time algorithms with approximation guarantees of O(log2k) for directed k-TSP, and O(logn) for directed orienteering (Chekuri & Pal [4]). Using the algorithm for directed orienteering within the framework of Blum et al.[2] and Bansal et al.[1], we also obtain poly-logarithmic approximation algorithms for the directed versions of discounted-reward TSPand the vehicle routing problem with time-windows.