A note on heuristics for the traveling salesman problem (Q3879044): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tight bounds for christofides' traveling salesman heuristic / rank | |||
Normal rank | |||
Revision as of 05:27, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on heuristics for the traveling salesman problem |
scientific article |
Statements
A note on heuristics for the traveling salesman problem (English)
0 references
1980
0 references
approximation
0 references
euclidean traveling salesman problem
0 references
worst case analysis
0 references
heuristic algorithms
0 references
ratio bounds
0 references
comparison of algorithms
0 references
algorithmic performance
0 references
