Understanding elementary landscapes
暂无分享,去创建一个
[1] Lionel Barnett,et al. Netcrawling-optimal evolutionary search with neutral networks , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[2] J. Wesley Barnes,et al. Linearity in the Traveling Salesman Problem , 2000, Appl. Math. Lett..
[3] Peter F. Stadler,et al. Algebraic Theory of Recombination Spaces , 1997, Evolutionary Computation.
[4] J. Wesley Barnes,et al. Arbitrary elementary landscapes & AR(1) processes , 2005, Appl. Math. Lett..
[5] Lov K. Grover. Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..
[6] J. Wesley Barnes,et al. Weakly symmetric graphs, elementary landscapes, and the TSP , 2003, Appl. Math. Lett..
[7] Christian M. Reidys,et al. Neutrality in fitness landscapes , 2001, Appl. Math. Comput..
[8] Adele E. Howe,et al. Understanding Algorithm Performance on an Oversubscribed Scheduling Application , 2006, J. Artif. Intell. Res..
[9] J. Wesley Barnes,et al. The theory of elementary landscapes , 2003, Appl. Math. Lett..
[10] Jacques Carlier,et al. Ordonnancements à contraintes disjonctives , 1978 .
[11] É. Taillard. Some efficient heuristic methods for the flow shop sequencing problem , 1990 .
[12] Jeremy Frank,et al. When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..
[13] P. Stadler. Landscapes and their correlation functions , 1996 .