1. Akay, R., Basturk, A., Kalinli, A., Yao, X.: Parallel population-based algorithm portfolios: an empirical study. Neurocomputing 247, 115–125 (2017)
2. Battiti, R., Mascia, F.: An algorithm portfolio for the sub-graph isomorphism problem. In: Stützle, T., Birattari, M., Hoos, H.H. (eds.) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS. Lecture Notes in Computer Science, vol. 4638, pp. 106–120. Springer, Berlin, Heidelberg (2007)
3. Calderín, J.F., Masegosa, A.D., Pelta, D.A.: An algorithm portfolio for the dynamic maximal covering location problem. Memetic Comput. 9, 141–151 (2016)
4. Gagliolo, M., Schmidhuber, J.: Algorithm portfolio selection as a bandit problem with unbounded losses. Ann. Math. Artif. Intell. 61(2), 49–86 (2011)
5. Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1–2), 43–62 (2001)