A 53-approximation algorithm for the clustered traveling salesman tour and path problems

Authors:
Shoshana Anily;Julien Bramel;Alain Hertz
Affiliations:
Faculty of Management, Tel-Aviv University, Tel-Aviv 69978, Israel;Graduate School of Business, Columbia University, 3022 Broadway, Uris Hall, New York, NY 10027-6902, USA;Département de Mathématiques, ícole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
Operations Research Letters
Year:
1999

Citing 2
Cited 2

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Analysis of Christofides' heuristic: Some paths are more difficult than cycles

Operations Research Letters

Improving christofides' algorithm for the s-t path TSP

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the ordered cluster traveling salesman problem (OCTSP). In this problem, a vehicle starting and ending at a given depot must visit a set of n points. The points are partitioned into K,K=