The traveling salesman problem. Approximate algorithms (Q917453): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Latest revision as of 02:36, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The traveling salesman problem. Approximate algorithms |
scientific article |
Statements
The traveling salesman problem. Approximate algorithms (English)
0 references
1989
0 references
efficiency of heuristic algorithms
0 references
traveling salesman
0 references
worst-case behavior
0 references
