Three easy special cases of the euclidean travelling salesman problem (Q4372111): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:00, 7 February 2024
scientific article; zbMATH DE number 1106855
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
