Finding good tours for huge Euclidean TSP instances by iterative backbone contraction (Q3578366)
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: Finding good tours for huge Euclidean TSP instances by iterative backbone contraction |
scientific article; zbMATH DE number 5758189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding good tours for huge Euclidean TSP instances by iterative backbone contraction |
scientific article; zbMATH DE number 5758189 |
Statements
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction (English)
0 references
20 July 2010
0 references
0.7947085499763489
0 references
0.7461546659469604
0 references
0.7289744019508362
0 references
0.7204664945602417
0 references
