Special cases of travelling salesman problems and heuristics (Q2639760)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Special cases of travelling salesman problems and heuristics |
scientific article; zbMATH DE number 4185361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Special cases of travelling salesman problems and heuristics |
scientific article; zbMATH DE number 4185361 |
Statements
Special cases of travelling salesman problems and heuristics (English)
0 references
1990
0 references
The author describes some recently analysed special cases of the travelling salesman problem (TSP) which can be solved in polynomial time. The use of special cases as heuristics for the TSP are discussed.
0 references
sum and bottleneck objectives
0 references
travelling salesman
0 references
heuristics
0 references
0 references
0 references
0 references
0.96788484
0 references
0.92619795
0 references
0.92024314
0 references
0.91606057
0 references
0.9066632
0 references
0.9053544
0 references
0.9020448
0 references
0 references
0.9002968
0 references
