Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour (Q1302598)
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: Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour |
scientific article; zbMATH DE number 1341115
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour |
scientific article; zbMATH DE number 1341115 |
Statements
Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour (English)
0 references
23 September 2001
0 references
0.8684791
0 references
0.8618808
0 references
0.8586689
0 references
0.8581188
0 references
0.8530085
0 references
0 references
0.8421865
0 references
0.83944225
0 references
0.83804375
0 references
