On the Hardness of the Quadratic Assignment Problem with Metaheuristics
Journal of Heuristics
Barrier Trees on Poset-Valued Landscapes
Genetic Programming and Evolvable Machines
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Towards an analysis of dynamic environments
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Dynamics of Local Search Trajectory in Traveling Salesman Problem
Journal of Heuristics
Network correlated data gathering with explicit communication: NP-completeness and algorithms
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Landscape analysis for multicast routing
Computer Communications
A review of metrics on permutations for search landscape analysis
Computers and Operations Research
Evolutionary benefits of evolvable component integration
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Computers and Operations Research
Stochastic protein folding simulation in the three-dimensional HP-model
Computational Biology and Chemistry
Scaling of program functionality
Genetic Programming and Evolvable Machines
A gaussian random field model of smooth fitness landscapes
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Inbreeding properties of geometric crossover and non-geometric recombinations
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Saddles and barrier in landscapes of generalized search operators
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Stochastic protein folding simulation in the d-dimensional HP-model
BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Abstract convex evolutionary search
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Self-organized combinatorial optimization
Expert Systems with Applications: An International Journal
In silica evolution of early metabolism
Artificial Life
Exact computation of the expectation curves of the bit-flip mutation using landscapes theory
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Geometry of evolutionary algorithms
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
A kolmogorov-type stability measure for evolutionary algorithms
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Elementary landscape decomposition of the frequency assignment problem
Theoretical Computer Science
Elementary landscape decomposition of the test suite minimization problem
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
A methodology to find the elementary landscape decomposition of combinatorial optimization problems
Evolutionary Computation
ILS-perturbation based on local optima structure for the QAP problem
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
A survey of the merit factor problem for binary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Coverage in fault-tolerant control
Automatica (Journal of IFAC)
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Local optima networks and the performance of iterated local search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Geometry of evolutionary algorithms
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Length scale for characterising continuous optimization problems
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Local optima networks with escape edges
EA'11 Proceedings of the 10th international conference on Artificial Evolution
Hyperplane initialized local search for MAXSAT
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Problem understanding through landscape theory
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Fitness function distributions over generalized search neighborhoods in the q-ary hypercube
Evolutionary Computation
dPSO-vis: topology-based visualization of discrete particle swarm optimization
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
| Hi-index | 0.01 |
Fitness landscapes have proven to be a valuable concept in evolutionary biology, combinatorial optimization, and the physics of disordered systems. A fitness landscape is a mapping from a configuration space into the real numbers. The configuration space is equipped with some notion of adjacency, nearness, distance, or accessibility. Landscape theory has emerged as an attempt to devise suitable mathematical structures for describing the ``static'' properties of landscapes as well as their influence on the dynamics of adaptation. In this review we focus on the connections of landscape theory with algebraic combinatorics and random graph theory, where exact results are available.