A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920)
From MaRDI portal
!
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 5128052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new asymmetric pyramidally solvable class of the traveling salesman problem |
scientific article; zbMATH DE number 5128052 |
Statements
A new asymmetric pyramidally solvable class of the traveling salesman problem (English)
0 references
19 February 2007
0 references
traveling salesman problem
0 references
pyramidal tour
0 references
polynomial time algorithm
0 references
0 references
0 references
0 references
0 references
0.8886717557907104
0 references
0.888360857963562
0 references
0.8644730448722839
0 references
0.821269690990448
0 references
0.8198243975639343
0 references
