A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4347274 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tight bounds for christofides' traveling salesman heuristic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Approximation Algorithm for the Traveling Salesman Problem with Backhauls / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4247262 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Procedures for travelling salesman problems with additional constraints / rank | |||
Normal rank | |||
Latest revision as of 09:29, 29 May 2024
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
