On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453): 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/s11590-014-0828-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983531822 / rank | |||
Normal rank | |||
Latest revision as of 00:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances |
scientific article |
Statements
On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (English)
0 references
24 September 2015
0 references
TSP
0 references
empirical complexity
0 references
exact algorithms
0 references
