The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d = d(n) such that, for every instance ℐ of the Asymmetric TSP on n cities, A produces a tour T which is not worse than at least d tours in ℐ including T itself. Two upper bounds on the domination number are proved.
