Technical Note—Clustering a Data Array and the Traveling-Salesman Problem (Q5183272): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.22.2.413 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2103938550 / rank | |||
Normal rank | |||
Latest revision as of 20:52, 19 March 2024
scientific article; zbMATH DE number 3431977
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Technical Note—Clustering a Data Array and the Traveling-Salesman Problem |
scientific article; zbMATH DE number 3431977 |
Statements
Technical Note—Clustering a Data Array and the Traveling-Salesman Problem (English)
0 references
1974
0 references
