Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141): 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.1007/s43069-021-00101-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117226423 / rank | |||
Normal rank | |||
Revision as of 22:02, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of a new heuristic for the travelling salesman problem |
scientific article |
Statements
Worst-case analysis of a new heuristic for the travelling salesman problem (English)
0 references
31 March 2022
0 references
triangularity condition
0 references
shortest spanning tree
0 references
worst-case analysis
0 references
