A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A 53-approximation algorithm for the clusterd traveling salesman tour and path problems |
scientific article; zbMATH DE number 1347065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems |
scientific article; zbMATH DE number 1347065 |
Statements
A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (English)
0 references
1999
0 references
analysis of algorithms
0 references
suboptimal algorithms
0 references
transportation
0 references
vehicle routing
0 references
ordered cluster traveling salesman problem
0 references
0.8501821160316467
0 references
0.8419588804244995
0 references
0.831380307674408
0 references
