Special cases of travelling salesman problems and heuristics (Q2639760)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Special cases of travelling salesman problems and heuristics |
scientific article |
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
