Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move (Q1357488)
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 a best traveling salesman 4-opt move in the same time as a best 2-opt move |
scientific article; zbMATH DE number 1019524
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move |
scientific article; zbMATH DE number 1019524 |
Statements
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move (English)
0 references
2 September 1997
0 references
4-opt moves
0 references
traveling salesman
0 references
acyclic shortest path model
0 references
0.83582294
0 references
0.8340482
0 references
0.82915694
0 references
0.82752097
0 references
0.8258493
0 references
0.82540715
0 references
0.8210801
0 references
0.8210799
0 references
0 references
