The component model for elementary landscapes and partial neighborhoods
From MaRDI portal
Publication:2250997
Recommendations
Cites work
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- A survey of search methodologies and automated system development for examination timetabling
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Arbitrary elementary landscapes \& AR(1) processes
- 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
- Landscapes and their correlation functions
- Linearity in the traveling salesman problem
- Local search and the local structure of NP-complete problems
- The landscape of the traveling salesman problem
- Weakly symmetric graphs, elementary landscapes, and the TSP
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
- A review of metrics on permutations for search landscape analysis
- The theory of elementary landscapes
- 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)