Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP

This publication has 5 references indexed in Scilit:

• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
  Discrete Applied Mathematics, 2002
• The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
  Published by Springer Nature ,2001
• TSP tour domination and Hamilton cycle decompositions of regular digraphs
  Operations Research Letters, 2001
• Construction heuristics for the asymmetric TSP
  European Journal of Operational Research, 2001
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
  Journal of the Operational Research Society, 1997