Rugged and elementary landscapes

DOI10.1007/978-3-642-33206-7_3MaRDI QIDQ3459673zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Konstantin Klemm, Peter F. Stadler

Publication date 11 January 2016

Published in Theory and Principled Methods for the Design of Metaheuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33206-7_3

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The theory of elementary landscapes
• scientific article; zbMATH DE number 1617336
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Landscapes and their correlation functions
• Landscapes on spaces of trees

Cites work

• A note on distance matrices yielding elementary landscapes for the TSP
• Amplitude Spectra of Fitness Landscapes
• Arbitrary elementary landscapes \& AR(1) processes
• Combinatorial landscapes
• Combinatorial vector fields and the valley structure of fitness landscapes
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Discrete nodal domain theorems
• Efficient computation of RNA folding dynamics
• Evolutionary Walks on Rugged Landscapes
• Fast Fourier transform for fitness landscapes
• Funnels in energy landscapes
• Graph partitioning by eigenvectors
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1273988 (Why is no real title available?)
• Landscapes and their correlation functions
• Landscapes on spaces of trees
• Local search and the local structure of NP-complete problems
• Metastable states in short-rangedp-spin glasses
• Neutrality in fitness landscapes.
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• On the classification of NP-complete problems in terms of their correlation coefficient
• Optimization by simulated annealing
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Quasiabelian landscapes of the traveling salesman problem are elementary
• Random field models for fitness landscapes
• Some additional properties of elementary landscapes
• The landscape of the traveling salesman problem
• The theory of elementary landscapes
• Weakly symmetric graphs, elementary landscapes, and the TSP

Cited in

(24)

• The theory of elementary landscapes
• Cover-encodings of fitness landscapes
• Landscapes on spaces of trees
• The component model for elementary landscapes and partial neighborhoods
• On the fractal nature of local optima networks
• Landscape statistics of the low-autocorrelation binary string problem
• scientific article; zbMATH DE number 1617336 (Why is no real title available?)
• scientific article; zbMATH DE number 1617353 (Why is no real title available?)
• scientific article; zbMATH DE number 1664954 (Why is no real title available?)
• In and out forests on combinatorial landscapes
• Constructing and exploring wells of energy landscapes
• Exact computation of the fitness-distance correlation for pseudoboolean functions with one global optimum
• scientific article; zbMATH DE number 2013561 (Why is no real title available?)
• scientific article; zbMATH DE number 1887343 (Why is no real title available?)
• scientific article; zbMATH DE number 1890109 (Why is no real title available?)
• Representing fitness landscapes by valued constraints to understand the complexity of local search
• How perturbation strength shapes the global structure of TSP fitness landscapes
• A Gaussian random field model of smooth fitness landscapes
• Elementary bit string mutation landscapes
• Saddles and Barrier in Landscapes of Generalized Search Operators
• On the landscape ruggedness of the quadratic assignment problem
• Optimisation via encodings: a renormalisation group perspective
• The fractal geometry of fitness landscapes at the local optima level
• Quasiabelian landscapes of the traveling salesman problem are elementary

This page was built for publication: Rugged and elementary landscapes

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