Weakly symmetric graphs, elementary landscapes, and the TSP

DOI10.1016/S0893-9659(03)80064-2zbMath1046.90100MaRDI QIDQ1431950

D. Massart

Publication date: 11 June 2004

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

TSPLaplacianElementary landscapesWeakly symmetric matrices

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Quasiabelian landscapes of the traveling salesman problem are elementary ⋮ Rugged and Elementary Landscapes ⋮ The theory of elementary landscapes ⋮ The component model for elementary landscapes and partial neighborhoods

Cites Work

• Unnamed Item
• Traveling salesman problem and local search
• Local search and the local structure of NP-complete problems
• Landscapes and their correlation functions
• Linearity in the traveling salesman problem

This page was built for publication: Weakly symmetric graphs, elementary landscapes, and the TSP