1. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2–3), 235–256 (2002). https://doi.org/10.1023/A:1013689704352
2. Belluz, J., Gaudesi, M., Squillero, G., Tonda, A.: Operator selection using improved dynamic multi-armed bandit. GECCO 2015, 1311–1317 (2015). https://doi.org/10.1145/2739480.2754712
3. Blot, A., Hoos, H.H., Jourdan, L., Marmion, M.É., Trautmann, H.: MO-ParamILS: a multi-objective automatic algorithm configuration framework. LION 10, 32–47 (2016)
4. Blot, A., Jourdan, L., Kessaci-Marmion, M.: Automatic design of multi-objective local search algorithms: case study on a bi-objective permutation flowshop scheduling problem. GECCO 2017, 227–234 (2017)
5. Lecture Notes in Computer Science;A Blot,2017