Three easy special cases of the euclidean travelling salesman problem (Q4372111)
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 1106855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three easy special cases of the euclidean travelling salesman problem |
scientific article; zbMATH DE number 1106855 |
Statements
Three easy special cases of the euclidean travelling salesman problem (English)
0 references
8 June 1998
0 references
distance matrix
0 references
travelling salesman problem
0 references
Demidenko conditions
0 references
Kalmanson conditions
0 references
Supnick conditions
0 references
polynomial time recognition algorithms
0 references
0.817808210849762
0 references
0.8160255551338196
0 references
