The theory of elementary landscapes

DOI10.1016/S0893-9659(03)80054-XzbMath1046.90095MaRDI QIDQ1431939

D. Massart

Publication date: 11 June 2004

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

zbMATH Keywords

Graph LaplacianElementary landscapeGrover's equation

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 (8)

Quasiabelian landscapes of the traveling salesman problem are elementary ⋮ Rugged and Elementary Landscapes ⋮ Computing the variance of tour costs over the solution space of the TSP in polynomial time ⋮ Autocorrelation measures for the quadratic assignment problem ⋮ Arbitrary elementary landscapes \& AR(1) processes ⋮ The characteristic landscape equation for an AR(2) landscape ⋮ Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem ⋮ Some additional properties of elementary landscapes

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Inertia characteristics of self-adjoint matrix polynomials
• Traveling salesman problem and local search
• Local search and the local structure of NP-complete problems
• Landscapes and their correlation functions
• Weakly symmetric graphs, elementary landscapes, and the TSP
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods

This page was built for publication: The theory of elementary landscapes