| Article ID: | iaor19891046 |
| Country: | France |
| Volume: | 22 |
| Issue: | 3 |
| Start Page Number: | 301 |
| End Page Number: | 308 |
| Publication Date: | Sep 1988 |
| Journal: | RAIRO Operations Research |
| Authors: | Jeromin Bernd, Krner Frank |
| Keywords: | programming: travelling salesman |
The quality of a heuristic for the traveling salesman problem is determined by its bound. Heuristics where the performance bounds depend on the asymmetry of the distance matrix are discussed. Two types of asymmetry, its relations and the relationship between different performance bounds are investigated. An algorithm for attaining a ‘good’ and ‘easily-computable’ bound is described.