| Article ID: | iaor19981479 |
| Country: | Netherlands |
| Volume: | 81 |
| Issue: | 3 |
| Start Page Number: | 553 |
| End Page Number: | 556 |
| Publication Date: | Mar 1995 |
| Journal: | European Journal of Operational Research |
| Authors: | Righini Giovanni, Trubian Marco |
| Keywords: | heuristics, computational analysis |
Two algorithms are presented for the asymmetric travelling salesman problem. The worst case performance of both of them is bounded by quantities which are independent of the size of the problem (number of vertices) but depend on the weights associated with the arcs. The second algorithm improves a bound previously obtained under identical hypothesis.