A [formula omitted]-approximation algorithm for the clustered traveling salesman tour and path problems

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⩽n , prespecified clusters. The vehicle must first visit the points in cluster 1, then the points in c...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research letters Vol. 24; no. 1; pp. 29 - 35
Main Authors:	Anily, Shoshana, Bramel, Julien, Hertz, Alain
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.1999
Subjects:	Analysis of algorithms Suboptimal algorithms Transportation Vehicle routing Suboptimal algorithms Analysis of algorithms Vehicle routing Transportation
ISSN:	0167-6377, 1872-7468
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!