Quasiabelian landscapes of the traveling salesman problem are elementary

DOI10.1016/J.DISOPT.2009.02.001MaRDI QIDQ834186zbMATH OpenOpenAlexFDO

Authors Andrew Solomon, B. 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

eigenvalueeigenvectorelementarygroup representationlandscapepermutationquasiabeliantraveling salesman problemTSP

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The theory of elementary landscapes
• The component model for elementary landscapes and partial neighborhoods
• Weakly symmetric graphs, elementary landscapes, and the TSP
• Rugged and elementary landscapes
• Fast Fourier transform for fitness landscapes

Cites work

• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 706263 (Why is no real title available?)
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Linearity in the traveling salesman problem
• Local search and the local structure of NP-complete problems
• Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods
• On quasiabelian Cayley graphs and graphical doubly regular representations
• The theory of elementary landscapes
• Traveling salesman problem and local search
• Weakly symmetric graphs, elementary landscapes, and the TSP

Cited in

(4)

• Weakly symmetric graphs, elementary landscapes, and the TSP
• Fast Fourier transform for fitness landscapes
• Rugged and elementary landscapes
• scientific article; zbMATH DE number 16400 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834186)