@incollection{kotthoff_algorithm_2016,
  address = {Cham},
  title = {Algorithm {Selection} for {Combinatorial} {Search} {Problems}: {A} {Survey}},
  isbn = {978-3-319-50137-6},
  url = {https://doi.org/10.1007/978-3-319-50137-6_7},
  abstract = {The Algorithm Selection Problem is concerned with selecting the best algorithm to solve a given problem on a case-by-case basis. It has become especially relevant in the last decade, as researchers are increasingly investigating how to identify the most suitable existing algorithm for solving a problem instead of developing new algorithms. This survey presents an overview of this work focusing on the contributions made in the area of combinatorial search problems, where Algorithm Selection techniques have achieved significant performance improvements. We unify and organise the vast literature according to criteria that determine Algorithm Selection systems in practice. The comprehensive classification of approaches identifies and analyses the different directions from which Algorithm Selection has been approached. This chapter contrasts and compares different methods for solving the problem as well as ways of using these solutions.},
  booktitle = {Data {Mining} and {Constraint} {Programming}: {Foundations} of a {Cross}-{Disciplinary} {Approach}},
  publisher = {Springer International Publishing},
  author = {Kotthoff, Lars},
  editor = {Bessiere, Christian and De Raedt, Luc and Kotthoff, Lars and Nijssen, Siegfried and O'Sullivan, Barry and Pedreschi, Dino},
  year = {2016},
  doi = {10.1007/978-3-319-50137-6_7},
  pages = {149--190}
}