Moving-target TSP and related problems

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

Volumn 1461 LNCS, Issue , 1998, Pages 453-464

  Helvig, C S ^a   Robins, Gabriel ^a   Zelikovsky, Alex ^a,b  

^a University of Virginia   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSTANT VELOCITIES; EXACT ALGORITHMS; MINIMUM TIME; MOVING-TARGET TSP; TIME DEPENDENT;

TRAVELING SALESMAN PROBLEM;

EID: 84896693004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_38     Document Type: Conference Paper

References (9)

1. T. H. Cormen, C. E. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990.
2. C. H. Helvig, G. Robins, and A. Zelikovsky. Moving target tsp and related problems. Technical Report CS-98-07, Department of Computer Science, University of Virginia, December 1997.
3. D. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1995.
4. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy, and D. B. Shmoys. The Traveling Salesman Problem: a Guided Tour of Combinatorial Optimization. John Wiley and Sons, Chichester, New York, 1985.
5. C. Malandraki and M. S. Daskin. Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Journal of Transportation Science, 26: 185-200, August 1992.
6. C. Malandraki and R. B. Dial. A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. European Journal of Operations Research, 90: 45-55, 1996.
7. G. Reinelt. The Traveling Salesman: Computational Solutions for TSP Applications. Springer Verlag, Berlin, Germany, 1994.
8. G. Rote. The traveling salesman problem for moving points on a line. Technical Report 232, Technische Universitat Graz, 1992.
9. R. J. Vander Wiel and N. V. Sahinidis. Heuristic bounds and test problem generation for the time-dependent traveling salesman problem. Journal of Transportation Science, 29: 167-183, May 1995.