Author:
Cotta Carlos,Fernández-Leiva Antonio J.
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Hart, W.E., Belew, R.K.: Optimizing an arbitrary function is hard for the genetic algorithm. In: Belew, R.K., Booker, L.B. (eds.) Proceedings of the 4 th International Conference on Genetic Algorithms, pp. 190–195. Morgan Kaufmann, San Mateo (1991)
2. Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)
3. Bonissone, P., Subbu, R., Eklund, N., Kiehl, T.: Evolutionary Algorithms + Domain Knowledge = Real-World Evolutionary Computation. IEEE Transactions on Evolutionary Computation 10(3), 256–280 (2006)
4. Lecture Notes in Computer Science;J. Puchinger,2005
5. International Series in Operations Research and Management Science;P. Moscato,2010
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献