The component model for elementary landscapes and partial neighborhoods
From MaRDI portal
Publication:2250997
DOI10.1016/J.TCS.2014.04.036zbMATH Open1419.90114OpenAlexW1995261709MaRDI QIDQ2250997FDOQ2250997
Authors: Darrell Whitley, Andrew M. Sutton, Gabriela Ochoa, Francisco Chicano 
Publication date: 10 July 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.036
Recommendations
Cites Work
- Title not available (Why is that?)
- A survey of search methodologies and automated system development for examination timetabling
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Landscapes and their correlation functions
- The landscape of the traveling salesman problem
- Local search and the local structure of NP-complete problems
- Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time
- Elementary landscape decomposition of the frequency assignment problem
- Weakly symmetric graphs, elementary landscapes, and the TSP
- Linearity in the traveling salesman problem
- Arbitrary elementary landscapes \& AR(1) processes
Cited In (8)
- Quasiabelian landscapes of the traveling salesman problem are elementary
- Weakly symmetric graphs, elementary landscapes, and the TSP
- Representing fitness landscapes by valued constraints to understand the complexity of local search
- The theory of elementary landscapes
- A review of metrics on permutations for search landscape analysis
- Why operator-induced neighborhoods are a bad idea
- Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem
- Extended neighborhood: Definition and characterization
This page was built for publication: The component model for elementary landscapes and partial neighborhoods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250997)
