Worst-case analysis of two travelling salesman heuristics (Q786657): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(84)90078-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018689801 / rank | |||
Normal rank | |||
Revision as of 23:44, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of two travelling salesman heuristics |
scientific article |
Statements
Worst-case analysis of two travelling salesman heuristics (English)
0 references
1984
0 references
symmetric travelling salesman problem
0 references
heuristics
0 references
worst-case performance
0 references
comparison of algorithms
0 references
