Poly-logarithmic approximation algorithms for directed vehicle routing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4627 LNCS, Issue , 2007, Pages 257-270

  Nagarajan, Viswanath ^a   Ravi, R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; POLYNOMIALS; PROBLEM SOLVING; VEHICLE ROUTING;

ASYMMETRIC METRICS;

APPROXIMATION ALGORITHMS;

EID: 38049053739     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74208-1_19     Document Type: Conference Paper

References (22)

1. Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time Windows. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 166-174 (2004)
2. Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation Algorithms for Orienteering and Discounted-Reward TSP. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 46-55 (2003)
3. Chekuri, C., Korula, N., Pal, M.: Improved Algorithms for Orienteering and Related Problems. Manuscript (2007)
4. Chekuri, C., Pal, M.: A recursive greedy algorithm for walks in directed graphs. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 245-253 (2005)
5. Desrochers, M., Desrosiers, J., Solomon, M.: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Operation Research 40, 342-354 (1992)
6. Frank, A.: On Connectivity properties of Eulerian digraphs. Annals of Discrete Mathematics, 41 (1989)
7. Frieze, A., Galbiati, G., Maffioli, F.: On the worst-case performance of some algorithms for the asymmetric travelling salesman problem. Networks 12, 23-39 (1982)
8. Goemans, M.X., Bertsimas, D.J.: On the parsimonious property of connectivity problems. In: Proceedings of the 1st annual ACM-SIAM symposium on Discrete algorithms, pp. 388-396 (1990)
9. Golden, B.L., Levy, L., Vohra, R.: The Orienteering Problem. Naval Research Logistics 34, 307-318 (1987)
10. Haimovich, M., Rinnooy, A.H.G.: Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research 10, 527-542 (1985)
11. Held, M., Karp, R.M.: The travelling salesman problem and minimum spanning trees. Operations Research 18, 1138-1162 (1970)
12. Jackson, B.: Some remarks on arc-connectivity, vertex splitting, and orientation in digraphs. Journal of Graph Theory 12(3), 429-436 (1988)
13. Kantor, M., Rosenwein, M.: The Orienteering Problem with Time Windows. Journal of the Operational Research Society 43, 629-635 (1992)
14. Kohen, A., Kan, A.R., Trienekens, H.: Vehicle Routing with Time Windows. Operations Research 36, 266-273 (1987)
15. Li, C.-L., Simchi-Levi, D., Desrochers, M.: On the distance constrained vehicle routing problem. Operations Research 40, 790-799 (1992)
16. Mader, W.: Construction of all n-fold edge-connected digraphs (German). European Journal of Combinatorics 3, 63-67 (1982)
17. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization (1999)
18. Savelsbergh, M.: Local Search for Routing Problems with Time Windows. Annals of Operations Research 4, 285-305 (1985)
19. Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transportation Science 29, 17-29 (1995)
20. Tan, K.C., Lee, L.H., Zhu, K.Q., Ou, K.: Heuristic Methods for Vehicle Routing Problems with Time Windows. Artificial Intelligence in Engineering, pp. 281-295 (2001)
21. Vempala, S., Yannakakis, M.: A convex relaxation for the asymmetric tsp. In: Proceedings of the 10th annual ACM-SIAM symposium on Discrete algorithms, pp. 975-976 (1999)
22. Williamson, D.: Analysis of the held-karp heuristic for the traveling salesman problem. Master's thesis, MIT Computer Science (1990)