Abstract
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 I of the Asymmetric TSP on n cities, A produces a tour T which is not worse than at least d tours in I including T itself. Two upper bounds on the domination number are proved.
| Original language | English |
|---|---|
| Pages (from-to) | 52-54 |
| Number of pages | 3 |
| Journal | Algorithmic Operations Research |
| Volume | 1 |
| Issue number | 1 |
| Publication status | Published - 2006 |