An approximation algorithm for the Traveling Salesman Problem with Backhauls

Operations Research

Volumn 45, Issue 4, 1997, Pages 639-641

  Gendreau, Michel ^a   Laporte, Gilbert ^a   Hertz, Alain ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; HEURISTIC METHODS; JOB ANALYSIS; SCHEDULING; TRANSPORTATION;

COST MATRIX; HAMILTONIAN CYCLE; TRAVELINGS SALESMAN PROBLEM;

TIME AND MOTION STUDY;

EID: 0031186818     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.45.4.639     Document Type: Article

References (4)

1. ARKIN, E. M., M. M. HALLDÓRSSON, AND R. HASSIN. 1993. Approximating the Tree and Tour Covers of a Graph. Inform. Process. Lett. 47, 275-282.
2. CASCO, D. O., B. L. GOLDEN, AND E. A. WASIL. 1988. Vehicle Routing With Backhauls. In Vehicle Routing: Methods and Studies. B. L. Golden and A. A. Assad (eds.). North-Holland, Amsterdam, 127-147.
3. CHISMAN, J. A. 1975. The Clustered Traveling Salesman Problem. Comput. Oper. Res. 2, 115-119.
4. CHRISTOFIDES, N. 1976. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem. Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University.