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...

Celý popis

Podrobná bibliografia

Vydané v:	Operations research letters Ročník 24; číslo 1; s. 29 - 35
Hlavní autori:	Anily, Shoshana, Bramel, Julien, Hertz, Alain
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.02.1999
Predmet:	Analysis of algorithms Suboptimal algorithms Transportation Vehicle routing Suboptimal algorithms Analysis of algorithms Vehicle routing Transportation
ISSN:	0167-6377, 1872-7468
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!