1. Garey, M.R., Jhonson, D.S.: Computers and Intractability, a Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)
2. Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization, Algorithms and Complexity. Prentice Hall, Upper Saddle River (1982)
3. Rendell, L., Cho, H.: Empirical learning as a function of concept character. Mach. Learn. 5, 267–298 (1990)
4. Lagoudakis, M., Littman, M.: Learning to select branching rules in the DPLL procedure for satisfiability. Electron. Notes Discrete Math. 9, 344–359 (2001)
5. Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 1–25 (2009)