Minimum vehicle routing with a common deadline

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

Volumn 4110 LNCS, Issue , 2006, Pages 212-223

  Nagarajan, Viswanath ^a   Ravi, R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; INTEGRAL EQUATIONS; TREES (MATHEMATICS);

CARDINALITY SETS; MINIMUM VEHICLE ROUTING PROBLEM; TREE METRICS;

PROBLEM SOLVING;

EID: 33750046002     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_21     Document Type: Conference Paper

References (16)

1. Esther M. Arkin, Refael Hassin, and Asaf Levin. Approximations for Minimum and Min-max Vehicle Routing Problems. Journal of Algorithms, 2005.
2. Esther M. Arkin, Joseph S. B. Mitchell, and Giri Narasimhan. Resource-constrained Geometric Network Optimization. SCG '98: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, pages 307-316, 1998.
3. Nikhil Bansal, Avrim Blum, Shuchi Chawla, and Adam Meyerson. Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time Windows. Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, pages 166-174, 2004.
4. Reuven Bar-Yehuda, Guy Even, and Shimon (Moni) Shahar. On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows. Proc. of ESA, pages 55-66, 2003.
5. C. Bazgan, R. Hassin, and J. Monnot. Approximation Algorithms for Some Vehicle Routing Problems. Discrete Applied Mathematics, 146:27-42, 2005.
6. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, and Maria Minkoff. Approximation Algorithms for Orienteering and Discounted-Reward TSP. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 46-55, 2003.
7. B. Carr and S. Vempala. Randomized meta-rounding. 32nd ACM Symposium on the Theory of Computing, pages 58-62, 2000.
8. N. Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. GSIA, CMU-Report 388, 1977.
9. C.L.Li, D. Simchi-Levi, and M. Desrochers. On the distance constrained vehicle routing problem. Operations Research, 40:790-799, 1992.
10. M. Desrochers, J.Desrosiers, and M. Solomon. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Operation Research, 40:342-354, 1992.
11. M. Kantor and M. Rosenwein. The Orienteering Problem with Time Windows. Journal of the Operational Research Society, 43:629-635, 1992.
12. Samir Khuller, Azarakhsh Malekian, and Julian Mestre. To Fill or not to Fill: The Gas Station Problem. Manuscript, 2006.
13. A. Kohen, A. R. Kan, and H. Trienekens. Vehicle Routing with Time Windows. Operations Research, 36:266-273, 1987.
14. Viswanath Nagarajan and R. Ravi. Minimum Vehicle Routing with a Common Deadline. https://server1.tepper.cmu.edu/gsiadoc/WP/2006-E53.pdf, 2006.
15. M. Savelsbergh. Local Search for Routing Problems with Time Windows. Annals of Operations Research, 4:285-305, 1985.
16. K. C. Tan, L. H. Lee, K. Q. Zhu, and K. Ou. Heuristic Methods for Vehicle Routing Problems with Time Windows. Artificial Intelligence in Engineering, pages 281-295, 2001.