|
|||||
|
|
A note on heuristics for the traveling salesman problem |
|
| Authors: | Gianfranco d'Atri |
| Affiliation: | (1) Departimento di Matematica, Università di Calabria, Cosenza, Italy |
| Abstract: | We introduce subclasses of the traveling salesman problem (TSP) and analyze the behaviour of heuristics on them. We derive bounds for the performance of the algorithms. |
| Keywords: | Traveling Salesman Problem Heuristics Approximation |
| 本文献已被 SpringerLink 等数据库收录！ | |