Weakly symmetric graphs, elementary landscapes, and the TSP Original Research Article

Weakly symmetric graphs are defined and their construction from symmetric graphs is explained. It is shown that the TSP on a weakly symmetric graph joined with each of a number of well-known local search neighbourhoods yields elementary landscapes (in which local minima are better than the average). In conclusion, an View the MathML source(n2) algorithm for identifying weakly symmetric graphs is described.