On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances |
scientific article; zbMATH DE number 6484990
| 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; zbMATH DE number 6484990 |
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
0 references
0.88652956
0 references
0.8840388
0 references
0.8732556
0 references
0.87322176
0 references
0.8684472
0 references
0.8656862
0 references
