A. Auger and O. Teytaud, Continuous Lunches Are Free Plus the Design of??Optimal Optimization Algorithms, Algorithmica, vol.1, issue.1, 2009.
DOI : 10.1007/s00453-008-9244-5
URL : https://hal.archives-ouvertes.fr/inria-00369788

N. Belkhir, J. Dréo, P. Savéant, and M. Schoenauer, Surrogate Assisted Feature Computation for Continuous Problems, Proc. LION, 2016.
DOI : 10.1007/978-3-319-50349-3_2
URL : https://hal.archives-ouvertes.fr/hal-01303320

B. Bischl, O. Mersmann, H. Trautmann, and M. Preuß, Algorithm selection based on exploratory landscape analysis and cost-sensitive learning, Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference, GECCO '12, pp.313-320, 2012.
DOI : 10.1145/2330163.2330209

J. Bossek, B. Bischl, T. Wagner, and G. Rudolph, Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement, Proceedings of the 2015 on Genetic and Evolutionary Computation Conference, GECCO '15, pp.1319-1326, 2015.
DOI : 10.1145/2739480.2754673

N. Hansen, A. Auger, S. Finck, and R. Ros, Real-Parameter Black-Box Optimization Benchmarking 2010: Experimental Setup, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00462481

H. H. Hoos, Programming by optimization, Communications of the ACM, vol.55, issue.2, pp.70-80, 2012.
DOI : 10.1145/2076450.2076469

F. Hutter, Y. Hamadi, H. H. Hoos, and K. Leyton-brown, Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms, pp.213-228, 2006.
DOI : 10.1007/11889205_17

F. Hutter, H. H. Hoos, and K. Leyton-brown, Sequential Model-Based Optimization for General Algorithm Configuration, Proc. LION 5, pp.507-523, 2011.
DOI : 10.1007/978-0-387-84858-7

F. Hutter, L. Xu, H. H. Hoos, and K. Leyton-brown, Algorithm runtime prediction: Methods & evaluation, Artificial Intelligence, vol.206, pp.79-111, 2014.
DOI : 10.1016/j.artint.2013.10.003

K. Leyton-brown, E. Nudelman, and Y. Shoham, Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions, Principles and Practice of Constraint Programming-CP 2002, pp.556-572, 2002.
DOI : 10.1007/3-540-46135-3_37

M. Lunacek and D. Whitley, The dispersion metric and the CMA evolution strategy, Proceedings of the 8th annual conference on Genetic and evolutionary computation , GECCO '06, pp.477-484, 2006.
DOI : 10.1145/1143997.1144085

O. Mersmann, B. Bischl, H. Trautmann, M. Preuss, C. Weihs et al., Exploratory landscape analysis, Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO '11, pp.829-836, 2011.
DOI : 10.1145/2001576.2001690

M. Munoz, M. Kirley, and S. K. Halgamuge, Exploratory Landscape Analysis of Continuous Space Optimization Problems Using Information Content, IEEE Transactions on Evolutionary Computation, vol.19, issue.1, pp.74-87, 2015.
DOI : 10.1109/TEVC.2014.2302006

M. A. Muñoz, M. Kirley, and S. K. Halgamuge, A meta-learning prediction model of algorithm performance for continuous optimization problems, pp.226-235, 2012.

J. R. Rice, The Algorithm Selection Problem, Advances in Computers, vol.15, pp.65-118, 1976.
DOI : 10.1016/S0065-2458(08)60520-3

R. Storn and K. Price, Differential evolution?a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, vol.11, issue.4, pp.341-359, 1997.
DOI : 10.1023/A:1008202821328

D. Wolpert and W. Macready, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.67-82, 1997.
DOI : 10.1109/4235.585893

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, Satzilla: portfolio-based algorithm selection for sat, Journal of Artificial Intelligence Research, pp.565-606, 2008.