Quasiabelian landscapes of the traveling salesman problem are elementary

DOI10.1016/j.disopt.2009.02.001zbMath1167.90635OpenAlexW2043023583MaRDI QIDQ834186

Andrew Solomon, Bruce W. Colletti

Publication date: 19 August 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2009.02.001

zbMATH Keywords

TSPeigenvalueeigenvectorpermutationgroup representationtraveling salesman problemelementarylandscapequasiabelian

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Rugged and Elementary Landscapes

Cites Work

• Unnamed Item
• Traveling salesman problem and local search
• Local search and the local structure of NP-complete problems
• On quasiabelian Cayley graphs and graphical doubly regular representations
• The theory of elementary landscapes
• Weakly symmetric graphs, elementary landscapes, and the TSP
• Linearity in the traveling salesman problem
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Computer Solutions of the Traveling Salesman Problem
• Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods

This page was built for publication: Quasiabelian landscapes of the traveling salesman problem are elementary