Untangling the Tapestry: k-Bounded Problems and Local Optima Networks
- 25 August 2026
- book chapter
- Published by Springer Nature
- p. 616-632
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Decomposition for Large-scale Optimization Problems with Overlapping Components2019
- Next Generation Genetic Algorithms: A User’s Guide and Tutorial2018
- Understanding Phase Transitions with Local Optima Networks: Number Partitioning as a Case Study2017
- Local Optima Networks with Escape Edges2012
- NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling2011
- Iterated Local Search2006
- Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination2005
- A genetic algorithm using linkage identification by nonlinearity check2003
- Sufficient conditions for deceptive and easy binary functionsAnnals of Mathematics and Artificial Intelligence, 1994
- The 2D±J Ising spin glass: exact partition functions in polynomial timeNuclear Physics B, 1994