Enhancing partition crossover with articulation points analysis
暂无分享,去创建一个
[1] Doug Hains,et al. Tunneling between optima: partition crossover for the traveling salesman problem , 2009, GECCO.
[2] L. Darrell Whitley,et al. Partition Crossover for Pseudo-Boolean Optimization , 2015, FOGA.
[3] L. Darrell Whitley,et al. Gray Box Optimization for Mk Landscapes (NK Landscapes and MAX-kSAT) , 2016, Evolutionary Computation.
[4] Andrew M. Sutton,et al. Efficient identification of improving moves in a ball for pseudo-boolean problems , 2014, GECCO.
[5] L. Darrell Whitley,et al. Polynomial Time Summary Statistics for a Generalization of MAXSAT , 1999, GECCO.
[6] L. Darrell Whitley,et al. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search , 2017, GECCO.
[7] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[8] Alden H. Wright. The Computational Complexity of NK Fitness Functions , 2017 .
[9] Alden H. Wright,et al. The computational complexity of N-K fitness functions , 2000, IEEE Trans. Evol. Comput..
[10] M. Newman,et al. Effects of neutral selection on the evolution of molecular species , 1997, adap-org/9712005.