The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(92)90138-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968594877 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 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
0 references
0 references
0 references
0 references
0 references
