Quasi-elementary Landscapes and Superpositions of Elementary Landscapes
暂无分享,去创建一个
[1] Enrique Alba,et al. Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization , 2013, J. Heuristics.
[2] Enrique Alba,et al. Elementary landscape decomposition of the frequency assignment problem , 2011, Theor. Comput. Sci..
[3] Andrew M. Sutton,et al. Understanding elementary landscapes , 2008, GECCO '08.
[4] Andrew M. Sutton,et al. A Theoretical Analysis of the k-Satisfiability Search Space , 2009, SLS.
[5] Andrew M. Sutton,et al. Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time , 2012, Theor. Comput. Sci..
[6] Günther Stattenberger,et al. On the Neighborhood Structure of the Traveling Salesman Problem Generated by Local Search Moves , 2007 .
[7] Kengo Katayama,et al. An effective local search for the maximum clique problem , 2005, Inf. Process. Lett..
[8] S. Kauffman,et al. Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.
[9] Andrew M. Sutton,et al. Partial neighborhoods of elementary landscapes , 2009, GECCO '09.
[10] Enrique Alba,et al. A Methodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems , 2011, Evolutionary Computation.
[11] Enrique Alba,et al. Elementary landscapes of frequency assignment problems , 2010, GECCO '10.
[12] Lov K. Grover. Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..