On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Concorde / rank | |||
Normal rank | |||
Revision as of 09:04, 29 February 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
