A Complex-Networks View of Hard Combinatorial Search Spaces
From MaRDI portal
Publication:4649208
DOI10.1007/978-3-642-32726-1_6zbMath1251.90341OpenAlexW113367472MaRDI QIDQ4649208
Publication date: 20 November 2012
Published in: EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32726-1_6
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- Theoretical aspects of evolutionary computing. 2nd EvoNet Summer School, Middelheim campus, Univ. of Antwerp, Belgium, September 1999
- Combinatorial Landscapes
- Efficiency of Local Search with Multiple Local Optima
- Random-energy model: An exactly solvable model of disordered systems
- Comparison of iterative searches for the quadratic assignment problem
- Networks
This page was built for publication: A Complex-Networks View of Hard Combinatorial Search Spaces