A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems |
scientific article |
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
