Three easy special cases of the euclidean travelling salesman problem (Q4372111): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2413690630 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:43, 20 March 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
