On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59585904, #quickstatements; #temporary_batch_1706974296281 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59585904 / rank | |||
Normal rank | |||
Revision as of 17:21, 3 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
