Efficient Hill Climber for Constrained Pseudo-Boolean Optimization Problems
暂无分享,去创建一个
[1] L. Darrell Whitley. Mk Landscapes, NK Landscapes, MAX-kSAT: A Proof that the Only Challenging Problems are Deceptive , 2015, GECCO.
[2] L. Darrell Whitley,et al. An Empirical Evaluation of O(1) Steepest Descent for NK-Landscapes , 2012, PPSN.
[3] Kiyoshi Tanaka,et al. Insights on properties of multiobjective MNK-landscapes , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).
[4] Pierre Hansen,et al. The basic algorithm for pseudo-Boolean programming revisited , 1988, Discret. Appl. Math..
[5] R. Kraus,et al. Air Force Office of Scientific Research , 2015 .
[6] L. Darrell Whitley,et al. Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization , 2016, EvoCOP.
[7] Deeparnab Chakrabarty,et al. Knapsack Problems , 2008 .
[8] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .
[9] Thomas Stützle,et al. On local optima in multiobjective combinatorial optimization problems , 2007, Ann. Oper. Res..
[10] Doug Hains,et al. Second order partial derivatives for NK-landscapes , 2013, GECCO '13.
[11] Joshua D. Knowles. A summary-attainment-surface plotting method for visualizing the performance of stochastic multiobjective optimizers , 2005, 5th International Conference on Intelligent Systems Design and Applications (ISDA'05).
[12] L. Darrell Whitley,et al. Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT , 2012, GECCO '12.
[13] Andrew M. Sutton,et al. Efficient identification of improving moves in a ball for pseudo-boolean problems , 2014, GECCO.
[14] William F. Punch,et al. Gray-Box Optimization using the Parameter-less Population Pyramid , 2015, GECCO.