The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:43, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The traveling salesman problem: An overview of exact and approximate algorithms |
scientific article |
Statements
The traveling salesman problem: An overview of exact and approximate algorithms (English)
0 references
11 October 1992
0 references
survey
0 references
traveling salesman
0 references
complexity analysis
0 references
exact algorithms
0 references
heuristic algorithms
0 references
