1. Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’07, pp. 1027–1035. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2007).
http://dl.acm.org/citation.cfm?id=1283383.1283494
2. Bartz-Beielstein, T., Lasarczyk, C.W., Preuß, M.: Sequential parameter optimization. In: The 2005 IEEE Congress on Evolutionary Computation, 2005, vol. 1, pp. 773–780. IEEE (2005)
3. Belkhir, N., Dréo, J., Savéant, P., Schoenauer, M.: Feature based algorithm configuration: a case study with differential evolution. In: International Conference on Parallel Problem Solving from Nature, pp. 156–166. Springer (2016)
4. Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(S12), 1695–1724 (2013).
https://doi.org/10.1057/jors.2013.71
5. Das, S., Suganthan, P.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2011).
https://doi.org/10.1109/TEVC.2010.2059031