The parallel complexity of TSP heuristics (Q4729351): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: G. A. P. Kindervater / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Jan Karel Lenstra / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2105656484 / rank | |||
Normal rank | |||
Latest revision as of 00:25, 20 March 2024
scientific article; zbMATH DE number 4114010
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parallel complexity of TSP heuristics |
scientific article; zbMATH DE number 4114010 |
Statements
The parallel complexity of TSP heuristics (English)
0 references
1989
0 references
parallel complexity
0 references
traveling salesman
0 references
heuristic algorithms
0 references
