Lexicographically minimizing axial motions for the Euclidean TSP (Q2268758)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5678771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lexicographically minimizing axial motions for the Euclidean TSP |
scientific article; zbMATH DE number 5678771 |
Statements
Lexicographically minimizing axial motions for the Euclidean TSP (English)
0 references
9 March 2010
0 references
traveling salesman problem
0 references
lexicographical optimization
0 references
shortest path
0 references
0.7554923295974731
0 references
0.7261156439781189
0 references
0.7190777063369751
0 references
0.719014585018158
0 references
0.7184569239616394
0 references
