{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:32:06Z","timestamp":1781386326867,"version":"3.54.1"},"publisher-location":"Cham","reference-count":165,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319501369","type":"print"},{"value":"9783319501376","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50137-6_7","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T10:41:48Z","timestamp":1480675308000},"page":"149-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":81,"title":["Algorithm Selection for Combinatorial Search Problems: A Survey"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kotthoff","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"key":"7_CR1","first-page":"1","volume-title":"Machine Learning Proceedings 1992","author":"David W. Aha","year":"1992","unstructured":"Aha, D.W.: Generalizing from case studies: a case study. In: Proceedings of the 9th International Workshop on Machine Learning, pp. 1\u201310. Morgan Kaufmann Publishers Inc, San Francisco (1992)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-61291-2_40","volume-title":"Advances in Artifical Intelligence","author":"JA Allen","year":"1996","unstructured":"Allen, J.A., Minton, S.: Selecting the right heuristic algorithm: runtime performance predictors. In: McCalla, G. (ed.) AI 1996. LNCS, vol. 1081, pp. 41\u201353. Springer, Heidelberg (1996). doi:10.1007\/3-540-61291-2_40"},{"issue":"4\u20135","key":"7_CR3","first-page":"509","volume":"14","author":"R Amadini","year":"2014","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: SUNNY: a lazy portfolio approach for constraint solving. TPLP 14(4\u20135), 509\u2013524 (2014)","journal-title":"TPLP"},{"issue":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/1543135.1542481","volume":"44","author":"J Ansel","year":"2009","unstructured":"Ansel, J., Chan, C., Wong, Y.L., Olszewski, M., Zhao, Q., Edelman, A., Amarasinghe, S.: PetaBricks: a language and compiler for algorithmic choice. SIGPLAN Not. 44(6), 38\u201349 (2009)","journal-title":"SIGPLAN Not."},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04244-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142\u2013157. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-04244-7_14"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Hamadi, Y., Sebag, M.: Online heuristic selection in constraint programming. In: Symposium on Combinatorial Search (2009)","DOI":"10.1109\/ICTAI.2010.17"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Armstrong, W., Christen, P., McCreath, E., Rendell, A.P.: Dynamic algorithm selection using reinforcement learning. In: International Workshop on Integrating AI and Data Mining, pp. 18\u201325, December 2006","DOI":"10.1109\/AIDM.2006.4"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Balasubramaniam, D., Gent, I.P., Jefferson, C., Kotthoff, L., Miguel, I., Nightingale, P.: An automated approach to generating efficient constraint solvers. In: 34th International Conference on Software Engineering, pp. 661\u2013671, June 2012","DOI":"10.1109\/ICSE.2012.6227151"},{"issue":"1\u20132","key":"7_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E Bauer","year":"1999","unstructured":"Bauer, E., Kohavi, R.: An empirical comparison of voting classification algorithms: bagging, boosting, and variants. Mach. Learn. 36(1\u20132), 105\u2013139 (1999)","journal-title":"Mach. Learn."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0004-3702(99)00099-5","volume":"117","author":"JC Beck","year":"2000","unstructured":"Beck, J.C., Fox, M.S.: Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artif. Intell. 117(1), 31\u201381 (2000)","journal-title":"Artif. Intell."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-24664-0_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"JC Beck","year":"2004","unstructured":"Beck, J.C., Freuder, E.C.: Simple rules for low-knowledge algorithm selection. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 50\u201364. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24664-0_4"},{"key":"7_CR12","unstructured":"Bhowmick, S., Eijkhout, V., Freund, Y., Fuentes, E., Keyes, D.: Application of machine learning in selecting sparse linear solvers. Technical report, Columbia University (2006)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-01970-8_45","volume-title":"Computational Science \u2013 ICCS 2009","author":"S Bhowmick","year":"2009","unstructured":"Bhowmick, S., Toth, B., Raghavan, P.: Towards low-cost, high-accuracy classifiers for linear solver selection. In: Allen, G., Nabrzyski, J., Seidel, E., Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009. LNCS, vol. 5544, pp. 463\u2013472. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-01970-8_45"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1011432307724","volume":"6","author":"JE Borrett","year":"2001","unstructured":"Borrett, J.E., Tsang, E.P.K.: A context for constraint satisfaction problem formulation selection. Constraints 6(4), 299\u2013327 (2001)","journal-title":"Constraints"},{"key":"7_CR15","unstructured":"Borrett, J.E., Tsang, E.P.K., Walsh, N.R.: Adaptive constraint satisfaction: The quickest first principle. In: ECAI, pp. 160\u2013164 (1996)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Bougeret, M., Dutot, P., Goldman, A., Ngoko, Y., Trystram, D.: Combining multiple heuristics on discrete resources. In: IEEE International Symposium on Parallel and Distributed Processing, pp. 1\u20138. IEEE Computer Society, Washington, DC (2009)","DOI":"10.1109\/IPDPS.2009.5160879"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-45164-1_8","volume-title":"Machine Learning: ECML 2000","author":"PB Brazdil","year":"2000","unstructured":"Brazdil, P.B., Soares, C.: A comparison of ranking methods for classification algorithm selection. In: L\u00f3pez de M\u00e1ntaras, R., Plaza, E. (eds.) ECML 2000. LNCS (LNAI), vol. 1810, pp. 63\u201375. Springer, Heidelberg (2000). doi:10.1007\/3-540-45164-1_8"},{"issue":"2","key":"7_CR18","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123\u2013140 (1996)","journal-title":"Mach. Learn."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Brewer, E.A.: High-level optimization via automated statistical modeling. In: Proceedings of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming PPOPP 1995, pp. 80\u201391. ACM, New York (1995)","DOI":"10.1145\/209937.209946"},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/B978-1-55860-307-3.50009-5","volume-title":"Machine Learning Proceedings 1993","author":"Carla E. Brodley","year":"1993","unstructured":"Brodley, C.E.: Addressing the selective superiority problem: automatic algorithm\/model class selection. In: ICML, pp. 17\u201324 (1993)"},{"issue":"4\u20136","key":"7_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0378-4754(94)90072-8","volume":"36","author":"E Cahill","year":"1994","unstructured":"Cahill, E.: Knowledge-based algorithm construction for real-world engineering PDEs. Math. Comput. Simul. 36(4\u20136), 389\u2013400 (1994)","journal-title":"Math. Comput. Simul."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/122344.122353","volume":"2","author":"J Carbonell","year":"1991","unstructured":"Carbonell, J., Etzioni, O., Gil, Y., Joseph, R., Knoblock, C., Minton, S., Veloso, M.: PRODIGY: an integrated architecture for planning and learning. SIGART Bull. 2, 51\u201355 (1991)","journal-title":"SIGART Bull."},{"key":"7_CR23","unstructured":"Carchrae, T., Beck, J.C.: Low-knowledge algorithm control. In: AAAI, pp. 49\u201354 (2004)"},{"issue":"4","key":"7_CR24","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1111\/j.1467-8640.2005.00278.x","volume":"21","author":"T Carchrae","year":"2005","unstructured":"Carchrae, T., Beck, J.C.: Applying machine learning to Low-knowledge control of optimization algorithms. Comput. Intell. 21(4), 372\u2013387 (2005)","journal-title":"Comput. Intell."},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-48085-3_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 1999","author":"Y Caseau","year":"1999","unstructured":"Caseau, Y., Laburthe, F., Silverstein, G.: A meta-heuristic factory for vehicle routing problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 144\u2013158. Springer, Heidelberg (1999). doi:10.1007\/978-3-540-48085-3_11"},{"key":"7_CR26","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: 12th International Joint Conference on Artificial Intelligence, pp. 331\u2013337. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA (1991)"},{"key":"7_CR27","unstructured":"Cicirello, V.A., Smith, S.F.: The max k-armed bandit: a new model of exploration applied to search heuristic selection. In: Proceedings of the 20th National Conference on Artificial Intelligence, pp. 1355\u20131361. AAAI Press (2005)"},{"key":"7_CR28","unstructured":"Cook, D.J., Varnell, R.C.: Maximizing the benefits of parallel search using machine learning. In: Proceedings of the 14th National Conference on Artificial Intelligence, pp. 559\u2013564. AAAI Press (1997)"},{"issue":"2","key":"7_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/JPROC.2004.840848","volume":"93","author":"J Demmel","year":"2005","unstructured":"Demmel, J., Dongarra, J., Eijkhout, V., Fuentes, E., Petitet, A., Vuduc, R., Whaley, R.C., Yelick, K.: Self-adapting linear algebra algorithms and software. Proc. IEEE 93(2), 293\u2013312 (2005)","journal-title":"Proc. IEEE"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45014-9_1","volume-title":"Multiple Classifier Systems","author":"TG Dietterich","year":"2000","unstructured":"Dietterich, T.G.: Ensemble methods in machine learning. In: Kittler, J., Roli, F. (eds.) MCS 2000. LNCS, vol. 1857, pp. 1\u201315. Springer, Heidelberg (2000). doi:10.1007\/3-540-45014-9_1"},{"key":"7_CR31","unstructured":"Domingos, P.: How to get a free lunch: a simple cost model for machine learning applications. In: AAAI98\/ICML98 Workshop on the Methodology of Applying Machine Learning, pp. 1\u20137. AAAI Press (1998)"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Domshlak, C., Karpas, E., Markovitch, S.: To max or not to max: online learning for speeding up optimal planning. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7741"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Elsayed, S.A.M., Michel, L.: Synthesis of search algorithms from high-level CP models. In: Proceedings of the 9th International Workshop on Constraint Modelling and Reformulation, September 2010","DOI":"10.1007\/978-3-642-23786-7_21"},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-23786-7_21","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"SAM Elsayed","year":"2011","unstructured":"Elsayed, S.A.M., Michel, L.: Synthesis of search algorithms from high-level CP models. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 256\u2013270. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-23786-7_21"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-45578-7_4","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2001","author":"SL Epstein","year":"2001","unstructured":"Epstein, S.L., Freuder, E.C.: Collaborative learning for constraint solving. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 46\u201360. Springer, Heidelberg (2001). doi:10.1007\/3-540-45578-7_4"},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/3-540-46135-3_35","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"SL Epstein","year":"2002","unstructured":"Epstein, S.L., Freuder, E.C., Wallace, R., Morozov, A., Samuels, B.: The adaptive constraint engine. In: Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 525\u2013540. Springer, Heidelberg (2002). doi:10.1007\/3-540-46135-3_35"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Ewald, R., Schulz, R., Uhrmacher, A.M.: Selecting simulation algorithm portfolios by genetic algorithms. In: IEEE Workshop on Principles of Advanced and Distributed Simulation PADS 2010, IEEE Computer Society, Washington, DC (2010)","DOI":"10.1109\/PADS.2010.5471673"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Fawcett, C., Vallati, M., Hutter, F., Hoffmann, J., Hoos, H., Leyton-Brown, K.: Improved features for runtime prediction of domain-independent planners. In: ICAPS (2014)","DOI":"10.1609\/icaps.v24i1.13680"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Fink, E.: Statistical selection among problem-solving methods. Technical report CMU-CS-97-101. Carnegie Mellon University (1997)","DOI":"10.21236\/ADA327284"},{"key":"7_CR40","unstructured":"Fink, E.: How to solve it automatically: selection among problem-solving methods. In: Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, pp. 128\u2013136. AAAI Press (1998)"},{"key":"7_CR41","first-page":"1304","volume":"2","author":"AS Fukunaga","year":"2000","unstructured":"Fukunaga, A.S.: Genetic algorithm portfolios. IEEE Congr. Evol. Comput. 2, 1304\u20131311 (2000)","journal-title":"IEEE Congr. Evol. Comput."},{"key":"7_CR42","unstructured":"Fukunaga, A.S.: Automated discovery of composite SAT variable-selection heuristics. In: 18th National Conference on Artificial Intelligence, pp. 641\u2013648. American Association for Artificial Intelligence, Menlo Park (2002)"},{"key":"7_CR43","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1162\/evco.2008.16.1.31","volume":"16","author":"AS Fukunaga","year":"2008","unstructured":"Fukunaga, A.S.: Automated discovery of local search heuristics for satisfiability testing. Evol. Comput. 16, 31\u201361 (2008)","journal-title":"Evol. Comput."},{"key":"7_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/11550907_2","volume-title":"Artificial Neural Networks: Formal Models and Their Applications \u2013 ICANN 2005","author":"M Gagliolo","year":"2005","unstructured":"Gagliolo, M., Schmidhuber, J.: A neural network model for inter-problem adaptive online time allocation. In: Duch, W., Kacprzyk, J., Oja, E., Zadro\u017cny, S. (eds.) ICANN 2005. LNCS, vol. 3697, pp. 7\u201312. Springer, Heidelberg (2005). doi:10.1007\/11550907_2"},{"key":"7_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11889205_14","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"M Gagliolo","year":"2006","unstructured":"Gagliolo, M., Schmidhuber, J.: Impact of censored sampling on the performance of restart strategies. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 167\u2013181. Springer, Heidelberg (2006). doi:10.1007\/11889205_14"},{"issue":"3\u20134","key":"7_CR46","first-page":"295","volume":"47","author":"M Gagliolo","year":"2006","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. Ann. Math. Artif. Intell. 47(3\u20134), 295\u2013328 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"7_CR47","series-title":"Advances in Soft Computing","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-85863-8_75","volume-title":"Advances in Soft Computing","author":"M Gagliolo","year":"2008","unstructured":"Gagliolo, M., Schmidhuber, J.: Towards distributed algorithm portfolios. In: Corchado, J.M., Rodr\u00edguez, S., Llinas, J., Molina, J.M. (eds.) Advances in Soft Computing. AINSC, vol. 50, pp. 634\u2013643. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-85863-8_75"},{"issue":"2","key":"7_CR48","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10472-011-9228-z","volume":"61","author":"M Gagliolo","year":"2011","unstructured":"Gagliolo, M., Schmidhuber, J.: Algorithm portfolio selection as a bandit problem with unbounded losses. Ann. Math. Artif. Intell. 61(2), 49\u201386 (2011)","journal-title":"Ann. Math. Artif. Intell."},{"key":"7_CR49","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-30115-8_15","volume-title":"Machine Learning: ECML 2004","author":"M Gagliolo","year":"2004","unstructured":"Gagliolo, M., Zhumatiy, V., Schmidhuber, J.: Adaptive online time allocation to search algorithms. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 134\u2013143. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30115-8_15"},{"key":"7_CR50","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10732-010-9126-2","volume":"16","author":"P Garrido","year":"2010","unstructured":"Garrido, P., Riff, M.: DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic. J. Heuristics 16, 795\u2013834 (2010)","journal-title":"J. Heuristics"},{"key":"7_CR51","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/978-3-540-24664-0_27","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"Cormac Gebruers","year":"2004","unstructured":"Gebruers, C., Guerri, A., Hnich, B., Milano, M.: Making choices using structure at the instance level within a case based reasoning framework. In: CPAIOR, pp. 380\u2013386 (2004)"},{"key":"7_CR52","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/11536406_19","volume-title":"Case-Based Reasoning Research and Development","author":"Cormac Gebruers","year":"2005","unstructured":"Gebruers, C., Hnich, B., Bridge, D., Freuder, E.: Using CBR to select solution strategies in constraint programming. In: Proceedings of ICCBR 2005, pp. 222\u2013236 (2005)"},{"key":"7_CR53","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-20895-9_40","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., Ziller, S.: A portfolio solver for answer set programming: preliminary report. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 352\u2013357. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20895-9_40"},{"key":"7_CR54","unstructured":"Gent, I., Jefferson, C., Kotthoff, L., Miguel, I., Moore, N., Nightingale, P., Petrie, K.: Learning when to use lazy learning in constraint solving. In: 19th European Conference on Artificial Intelligence, pp. 873\u2013878, August 2010"},{"key":"7_CR55","unstructured":"Gent, I., Kotthoff, L., Miguel, I., Nightingale, P.: Machine learning for constraint solver design - a case study for the alldifferent constraint. In: 3rd Workshop on Techniques for implementing Constraint Programming Systems (TRICS), pp. 13\u201325 (2010)"},{"key":"7_CR56","doi-asserted-by":"crossref","unstructured":"Gerevini, A.E., Saetti, A., Vallati, M.: An automatically configurable portfolio-based planner with macro-actions: PbP. In: Proceedings of the 19th International Conference on Automated Planning and Scheduling, pp. 350\u2013353 (2009)","DOI":"10.1609\/icaps.v19i1.13386"},{"key":"7_CR57","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolio design: theory vs. practice. In: UAI, pp. 190\u2013197 (1997)"},{"key":"7_CR58","unstructured":"Gomes, C.P., Selman, B.: Practical aspects of algorithm portfolio design. In: Proceedings of 3rd ILOG International Users Meeting (1997)"},{"issue":"1\u20132","key":"7_CR59","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1\u20132), 43\u201362 (2001)","journal-title":"Artif. Intell."},{"key":"7_CR60","unstructured":"Gratch, J., DeJong, G.: COMPOSER: a probabilistic solution to the utility problem in speed-up learning. In: AAAI, pp. 235\u2013240 (1992)"},{"key":"7_CR61","unstructured":"Guerri, A., Milano, M.: Learning techniques for automatic algorithm portfolio selection. In: ECAI, pp. 475\u2013479 (2004)"},{"key":"7_CR62","unstructured":"Guo, H.: Algorithm selection for sorting and probabilistic inference: a machine learning-based approach. Ph.D. thesis, Kansas State University (2003)"},{"key":"7_CR63","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-30549-1_28","volume-title":"AI 2004: Advances in Artificial Intelligence","author":"H Guo","year":"2004","unstructured":"Guo, H., Hsu, W.H.: A learning-based algorithm selection meta-reasoner for the real-time MPE problem. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 307\u2013318. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30549-1_28"},{"key":"7_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-02777-2_30","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"S Haim","year":"2009","unstructured":"Haim, S., Walsh, T.: Restart strategy selection using machine learning techniques. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 312\u2013325. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-02777-2_30"},{"issue":"1\u20132","key":"7_CR65","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00044-5","volume":"81","author":"T Hogg","year":"1996","unstructured":"Hogg, T., Huberman, B.A., Williams, C.P.: Phase transitions and the search problem. Artif. Intell. 81(1\u20132), 1\u201315 (1996)","journal-title":"Artif. Intell."},{"issue":"46","key":"7_CR66","doi-asserted-by":"publisher","first-page":"16385","DOI":"10.1073\/pnas.0403723101","volume":"101","author":"L Hong","year":"2004","unstructured":"Hong, L., Page, S.E.: Groups of diverse problem solvers can outperform groups of high-ability problem solvers. Proc. Natl. Acad. Sci. U.S.A. 101(46), 16385\u201316389 (2004)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"4\u20135","key":"7_CR67","first-page":"569","volume":"14","author":"H Hoos","year":"2014","unstructured":"Hoos, H., Lindauer, M., Schaub, T.: claspfolio 2: Advances in algorithm selection for answer set programming. TPLP 14(4\u20135), 569\u2013585 (2014)","journal-title":"TPLP"},{"issue":"2","key":"7_CR68","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"HH Hoos","year":"2012","unstructured":"Hoos, H.H.: Programming by optimization. Commun. ACM 55(2), 70\u201380 (2012)","journal-title":"Commun. ACM"},{"key":"7_CR69","first-page":"1","volume":"15","author":"HH Hoos","year":"2014","unstructured":"Hoos, H.H., Kaminski, R., Lindauer, M., Schaub, T.: aspeed: Solver scheduling via answer set programming. Theory Pract. Logic Program. FirstView 15, 1\u201326 (2014)","journal-title":"Theory Pract. Logic Program. FirstView"},{"key":"7_CR70","unstructured":"Horvitz, E., Ruan, Y., Gomes, C.P., Kautz, H.A., Selman, B., Chickering, D.M.: A Bayesian approach to tackling hard computational problems. In: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, pp. 235\u2013244. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"key":"7_CR71","unstructured":"Hough, P.D., Williams, P.J.: Modern machine learning for automatic optimization algorithm selection. In: Proceedings of the INFORMS Artificial Intelligence and Data Mining Workshop, November 2006"},{"key":"7_CR72","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/10720246_5","volume-title":"Recent Advances in AI Planning","author":"AE Howe","year":"2000","unstructured":"Howe, A.E., Dahlman, E., Hansen, C., Scheetz, M., Mayrhauser, A.: Exploiting competitive planner performance. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS (LNAI), vol. 1809, pp. 62\u201372. Springer, Heidelberg (2000). doi:10.1007\/10720246_5"},{"issue":"5296","key":"7_CR73","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"BA Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 275(5296), 51\u201354 (1997)","journal-title":"Science"},{"key":"7_CR74","doi-asserted-by":"crossref","unstructured":"Hurley, B., Kotthoff, L., Malitsky, Y., O\u2019Sullivan, B.: Proteus: a hierarchical portfolio of solvers and transformations. In: CPAIOR, May 2014","DOI":"10.1007\/978-3-319-07046-9_22"},{"key":"7_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11889205_17","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"F Hutter","year":"2006","unstructured":"Hutter, F., Hamadi, Y., Hoos, H.H., Leyton-Brown, K.: Performance prediction and automated tuning of randomized and parametric algorithms. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 213\u2013228. Springer, Heidelberg (2006). doi:10.1007\/11889205_17"},{"key":"7_CR76","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-25566-3_40"},{"key":"7_CR77","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-34413-8_5","volume-title":"Learning and Intelligent Optimisation LION 6","author":"F Hutter","year":"2012","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Parallel algorithm configuration. In: Hamadi, Y., Schoenauer, M. (eds.) LION. LNCS, vol. 7219, pp. 55\u201370. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34413-8_5"},{"issue":"1","key":"7_CR78","first-page":"267","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Int. Res. 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Int. Res."},{"key":"7_CR79","unstructured":"Hutter, F., Hoos, H.H., St\u00fctzle, T.: Automatic algorithm configuration based on local search. In: Proceedings of the 22nd National Conference on Artificial Intelligence, pp. 1152\u20131157. AAAI Press (2007)"},{"key":"7_CR80","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/978-3-642-23786-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"Serdar Kadioglu","year":"2011","unstructured":"Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: 17th International Conference on Principles and Practice of Constraint Programming, pp. 454\u2013469 (2011)"},{"key":"7_CR81","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC instance-specific algorithm configuration. In: 19th European Conference on Artificial Intelligence, pp. 751\u2013756. IOS Press (2010)"},{"issue":"1","key":"7_CR82","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/151271.151275","volume":"19","author":"MS Kamel","year":"1993","unstructured":"Kamel, M.S., Enright, W.H., Ma, K.S.: ODEXPERT: an expert system to select numerical solvers for initial value ODE systems. ACM Trans. Math. Softw. 19(1), 44\u201362 (1993)","journal-title":"ACM Trans. Math. Softw."},{"key":"7_CR83","doi-asserted-by":"crossref","unstructured":"Kotthoff, L.: Hybrid regression-classification models for algorithm selection. In: 20th European Conference on Artificial Intelligence, pp. 480\u2013485, August 2012","DOI":"10.3233\/978-1-61499-098-7-480"},{"issue":"3","key":"7_CR84","first-page":"48","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"issue":"3","key":"7_CR85","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/AIC-2012-0533","volume":"25","author":"L Kotthoff","year":"2012","unstructured":"Kotthoff, L., Gent, I.P., Miguel, I.: An evaluation of machine learning in algorithm selection for search problems. AI Commun. 25(3), 257\u2013270 (2012)","journal-title":"AI Commun."},{"key":"7_CR86","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-19084-6_18","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2015","unstructured":"Kotthoff, L., Kerschke, P., Hoos, H., Trautmann, H.: Improving the state of the art in inexact TSP solving using per-instance algorithm selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 202\u2013217. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-19084-6_18"},{"key":"7_CR87","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-642-15396-9_27","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"Lars Kotthoff","year":"2010","unstructured":"Kotthoff, L., Miguel, I., Nightingale, P.: Ensemble classification for constraint solver configuration. In: 16th International Conference on Principles and Practices of Constraint Programming, pp. 321\u2013329, September 2010"},{"key":"7_CR88","doi-asserted-by":"crossref","unstructured":"Kroer, C., Malitsky, Y.: Feature filtering for Instance-Specific algorithm configuration. In: Proceedings of the 23rd International Conference on Tools with Artificial Intelligence (2011)","DOI":"10.1109\/ICTAI.2011.132"},{"key":"7_CR89","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1007\/978-3-540-69384-0_100","volume-title":"Computational Science \u2013 ICCS 2008","author":"E Kuefler","year":"2008","unstructured":"Kuefler, E., Chen, T.-Y.: On using reinforcement learning to solve sparse linear systems. In: Bubak, M., Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2008. LNCS, vol. 5101, pp. 955\u2013964. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-69384-0_100"},{"key":"7_CR90","unstructured":"Lagoudakis, M.G., Littman, M.L.: Algorithm selection using reinforcement learning. In: Proceedings of the 17th International Conference on Machine Learning, pp. 511\u2013518. Morgan Kaufmann Publishers Inc., San Francisco (2000)"},{"key":"7_CR91","doi-asserted-by":"crossref","unstructured":"Lagoudakis, M.G., Littman, M.L.: Learning to select branching rules in the DPLL procedure for satisfiability. In: LICS\/SAT, pp. 344\u2013359 (2001)","DOI":"10.1016\/S1571-0653(04)00332-4"},{"key":"7_CR92","unstructured":"Langley, P.: Learning effective search heuristics. In: IJCAI, pp. 419\u2013421 (1983)"},{"key":"7_CR93","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0020-7373(83)80030-3","volume":"18","author":"P Langley","year":"1983","unstructured":"Langley, P.: Learning search strategies through discrimination. Int. J. Man-Mach. Stud. 18, 513\u2013541 (1983)","journal-title":"Int. J. Man-Mach. Stud."},{"key":"7_CR94","unstructured":"Leite, R., Brazdil, P., Vanschoren, J., Queiros, F.: Using active testing and meta-level information for selection of classification algorithms. In: 3rd PlanLearn Workshop, August 2010"},{"key":"7_CR95","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-46135-3_37","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"K Leyton-Brown","year":"2002","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: the case of combinatorial auctions. In: Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 556\u2013572. Springer, Heidelberg (2002). doi:10.1007\/3-540-46135-3_37"},{"key":"7_CR96","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1538902.1538906","volume":"56","author":"K Leyton-Brown","year":"2009","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Empirical hardness models: methodology and a case study on combinatorial auctions. J. ACM 56, 1\u201352 (2009)","journal-title":"J. ACM"},{"key":"7_CR97","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-19084-6_1","volume-title":"Learning and Intelligent Optimization","author":"M Lindauer","year":"2015","unstructured":"Lindauer, M., Hoos, H., Hutter, F.: From sequential algorithm selection to parallel portfolio selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 1\u201316. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-19084-6_1"},{"key":"7_CR98","doi-asserted-by":"crossref","unstructured":"Lindauer, M., Hoos, H.H., Hutter, F., Schaub, T.: AutoFolio: algorithm configuration for algorithm selection. In: Twenty-Ninth AAAI Workshops on Artificial Intelligence, January 2015","DOI":"10.1613\/jair.4726"},{"key":"7_CR99","unstructured":"Little, J., Gebruers, C., Bridge, D., Freuder, E.: Capturing constraint programming experience: a case-based approach. In: Modref (2002)"},{"key":"7_CR100","unstructured":"Lobjois, L., Lema\u00eetre, M.: Branch and bound algorithm selection by performance prediction. In: Proceedings of the 15th National\/10th Conference on Artificial Intelligence\/Innovative Applications of Artificial Intelligence, pp. 353\u2013358. American Association for Artificial Intelligence, Menlo Park (1998)"},{"key":"7_CR101","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-21581-0_33","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"Y Malitsky","year":"2011","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Non-model-based algorithm portfolios for SAT. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 369\u2013370. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21581-0_33"},{"key":"7_CR102","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: IJCAI, August 2013"},{"key":"7_CR103","unstructured":"Minton, S.: An analytic learning system for specializing heuristics. In: Proceedings of the 13th International Joint Conference on Artifical Intelligence IJCAI 1993, pp. 922\u2013928. Morgan Kaufmann Publishers Inc., San Francisco (1993)"},{"key":"7_CR104","unstructured":"Minton, S.: Integrating heuristics for constraint satisfaction problems: a case study. In: Proceedings of the 11th National Conference on Artificial Intelligence, pp. 120\u2013126. AAAI (1993)"},{"key":"7_CR105","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00143877","volume":"1","author":"S Minton","year":"1996","unstructured":"Minton, S.: Automatically configuring constraint satisfaction programs: a case study. Constraints 1, 7\u201343 (1996)","journal-title":"Constraints"},{"key":"7_CR106","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-44973-4_42","volume-title":"Learning and Intelligent Optimization","author":"N Musliu","year":"2013","unstructured":"Musliu, N., Schwengerer, M.: Algorithm selection for the graph coloring problem. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 389\u2013403. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-44973-4_42"},{"key":"7_CR107","series-title":"Applied Optimization","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-1-4757-4137-7_25","volume-title":"Metaheuristics: Computer Decision-Making","author":"A Nareyek","year":"2001","unstructured":"Nareyek, A.: Choosing search heuristics by non-stationary reinforcement learning. In: Nareyek, A. (ed.) Metaheuristics: Computer Decision-Making. Applied Optimization, vol. 86, pp. 523\u2013544. Kluwer Academic Publishers, New York (2001)"},{"key":"7_CR108","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-02777-2_31","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Nikoli\u0107","year":"2009","unstructured":"Nikoli\u0107, M., Mari\u0107, F., Jani\u010di\u0107, P.: Instance-based selection of policies for SAT solvers. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 326\u2013340. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-02777-2_31"},{"key":"7_CR109","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding random SAT: beyond the clauses-to-variables ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 438\u2013452. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30201-8_33"},{"key":"7_CR110","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., O\u2019Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science (2008)"},{"key":"7_CR111","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1613\/jair.614","volume":"11","author":"D Opitz","year":"1999","unstructured":"Opitz, D., Maclin, R.: Popular ensemble methods: an empirical study. J. Artif. Intell. Res. 11, 169\u2013198 (1999)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR112","doi-asserted-by":"crossref","unstructured":"Paparrizou, A., Stergiou, K.: Evaluating simple fully automated heuristics for adaptive constraint propagation. In: ICTAI (2012)","DOI":"10.1109\/ICTAI.2012.123"},{"key":"7_CR113","unstructured":"Petrik, M.: Statistically optimal combination of algorithms. In: Local Proceedings of SOFSEM 2005 (2005)"},{"issue":"1\u20132","key":"7_CR114","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10472-007-9050-9","volume":"48","author":"M Petrik","year":"2006","unstructured":"Petrik, M., Zilberstein, S.: Learning parallel portfolios of algorithms. Ann. Math. Artif. Intell. 48(1\u20132), 85\u2013106 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"7_CR115","unstructured":"Petrovic, S., Qu, R.: Case-based reasoning as a heuristic selector in hyper-heuristic for course timetabling problems. In: KES, pp. 336\u2013340 (2002)"},{"key":"7_CR116","unstructured":"Pfahringer, B., Bensusan, H., Giraud-Carrier, C.G.: Meta-Learning by landmarking various learning algorithms. In: 17th International Conference on Machine Learning ICML 2000, pp. 743\u2013750, Morgan Kaufmann Publishers Inc., San Francisco (2000)"},{"key":"7_CR117","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-540-74970-7_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L Pulina","year":"2007","unstructured":"Pulina, L., Tacchella, A.: A multi-engine solver for quantified Boolean formulas. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 574\u2013589. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74970-7_41"},{"issue":"1","key":"7_CR118","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10601-008-9051-2","volume":"14","author":"L Pulina","year":"2009","unstructured":"Pulina, L., Tacchella, A.: A self-adaptive multi-engine solver for quantified boolean formulas. Constraints 14(1), 80\u2013116 (2009)","journal-title":"Constraints"},{"key":"7_CR119","first-page":"471","volume-title":"Machine Learning Proceedings 1995","author":"R. Bharat Rao","year":"1995","unstructured":"Rao, R.B., Gordon, D., Spears, W.: For every generalization action, is there really an equal and opposite reaction? Analysis of the conservation law for generalization performance. In: Proceedings of the 12th International Conference on Machine Learning, pp. 471\u2013479. Morgan Kaufmann (1995)"},{"key":"7_CR120","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"7_CR121","unstructured":"Rice, J.R., Ramakrishnan, N.: How to get a free lunch (at no cost). Techical report 99\u2013014, Purdue University, April 1999"},{"key":"7_CR122","unstructured":"Roberts, M., Howe, A.E.: Directing a portfolio with learning. In: AAAI 2006 Workshop on Learning for Search (2006)"},{"key":"7_CR123","unstructured":"Roberts, M., Howe, A.E.: Learned models of performance for many planners. In: ICAPS 2007 Workshop AI Planning and Learning (2007)"},{"key":"7_CR124","unstructured":"Roberts, M., Howe, A.E., Wilson, B., des Jardins, M.: What makes planners predictable? In: ICAPS, pp. 288\u2013295 (2008)"},{"key":"7_CR125","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-61551-2_73","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 1996","author":"H Sakkout","year":"1996","unstructured":"Sakkout, H., Wallace, M.G., Richards, E.B.: An instance of adaptive constraint propagation. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 164\u2013178. Springer, Heidelberg (1996). doi:10.1007\/3-540-61551-2_73"},{"key":"7_CR126","unstructured":"Samulowitz, H., Memisevic, R.: Learning to solve QBF. In: Proceedings of the 22nd National Conference on Artificial Intelligence, pp. 255\u2013260. AAAI Press (2007)"},{"key":"7_CR127","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11672142_19","volume-title":"STACS 2006","author":"T Sayag","year":"2006","unstructured":"Sayag, T., Fine, S., Mansour, Y.: Combining multiple heuristics. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 242\u2013253. Springer, Heidelberg (2006). doi:10.1007\/11672142_19"},{"issue":"2","key":"7_CR128","first-page":"197","volume":"5","author":"RE Schapire","year":"1990","unstructured":"Schapire, R.E.: The strength of weak learnability. Mach. Learn. 5(2), 197\u2013227 (1990)","journal-title":"Mach. Learn."},{"key":"7_CR129","unstructured":"Sillito, J.: Improvements to and estimating the cost of solving constraint satisfaction problems. Master\u2019s thesis, University of Alberta (2000)"},{"key":"7_CR130","doi-asserted-by":"crossref","unstructured":"Silverthorn, B., Miikkulainen, R.: Latent class models for algorithm portfolio methods. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (2010)","DOI":"10.1609\/aaai.v24i1.7546"},{"key":"7_CR131","doi-asserted-by":"crossref","unstructured":"Smith, T.E., Setliff, D.E.: Knowledge-based constraint-driven software synthesis. In: Knowledge-Based Software Engineering Conference, pp. 18\u201327, September 1992","DOI":"10.1109\/KBSE.1992.252912"},{"issue":"5","key":"7_CR132","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., Lopes, L.: Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875\u2013889 (2012)","journal-title":"Comput. Oper. Res."},{"key":"7_CR133","doi-asserted-by":"publisher","first-page":"6: 1","DOI":"10.1145\/1456650.1456656","volume":"41","author":"KA Smith-Miles","year":"2008","unstructured":"Smith-Miles, K.A.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41, 6: 1\u20136: 25 (2008)","journal-title":"ACM Comput. Surv."},{"key":"7_CR134","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.A.: Towards insightful algorithm selection for optimisation using meta-learning concepts. In: IEEE International Joint Conference on Neural Networks, pp. 4118\u20134124, June 2008","DOI":"10.1109\/IJCNN.2008.4634391"},{"issue":"3","key":"7_CR135","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/B:MACH.0000015879.28004.9b","volume":"54","author":"C Soares","year":"2004","unstructured":"Soares, C., Brazdil, P.B., Kuba, P.: A meta-learning method to select the kernel width in support vector regression. Mach. Learn. 54(3), 195\u2013209 (2004)","journal-title":"Mach. Learn."},{"issue":"3","key":"7_CR136","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/AIC-2009-0450","volume":"22","author":"K Stergiou","year":"2009","unstructured":"Stergiou, K.: Heuristics for dynamically adapting propagation in constraint satisfaction problems. AI Commun. 22(3), 125\u2013141 (2009)","journal-title":"AI Commun."},{"key":"7_CR137","doi-asserted-by":"crossref","unstructured":"Stern, D.H., Samulowitz, H., Herbrich, R., Graepel, T., Pulina, L., Tacchella, A.: Collaborative expert portfolio management. In: AAAI, pp. 179\u2013184 (2010)","DOI":"10.1609\/aaai.v24i1.7561"},{"key":"7_CR138","unstructured":"Streeter, M.J., Golovin, D., Smith, S.F.: Combining multiple heuristics online. In: Proceedings of the 22nd National Conference on Artificial Intelligence, pp. 1197\u20131203. AAAI Press (2007)"},{"key":"7_CR139","unstructured":"Streeter, M.J., Golovin, D., Smith, S.F.: Restart schedules for ensembles of problem instances. In: Proceedings of the 22nd National Conference on Artificial Intelligence, pp. 1204\u20131210. AAAI Press (2007)"},{"key":"7_CR140","unstructured":"Streeter, M.J., Smith, S.F.: New techniques for algorithm portfolio design. In: UAI, pp. 519\u2013527 (2008)"},{"key":"7_CR141","unstructured":"Terashima-Mar\u00edn, H., Ross, P., Valenzuela-Rend\u00f3n, M.: Evolution of constraint satisfaction strategies in examination timetabling. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 635\u2013642. Morgan Kaufmann (1999)"},{"key":"7_CR142","unstructured":"Tolpin, D., Shimony, S.E.: Rational deployment of CSP heuristics. In: IJCAI, pp. 680\u2013686 (2011)"},{"key":"7_CR143","unstructured":"Tsang, E.P.K., Borrett, J.E., Kwan, A.C.M.: An attempt to map the performance of a range of algorithm and heuristic combinations. In: Proceedings of AISB 1995, pp. 203\u2013216. IOS Press (1995)"},{"key":"7_CR144","unstructured":"Utgoff, P.E.: Perceptron trees: a case study in hybrid concept representations. In: National Conference on Artificial Intelligence, pp. 601\u2013606 (1988)"},{"key":"7_CR145","doi-asserted-by":"crossref","unstructured":"Vassilevska, V., Williams, R., Woo, S.L.M.: Confronting hardness using a hybrid approach. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2006, pp. 1\u201310. ACM, New York (2006)","DOI":"10.1145\/1109557.1109558"},{"key":"7_CR146","unstructured":"Vrakas, D., Tsoumakas, G., Bassiliades, N., Vlahavas, I.: Learning rules for adaptive planning. In: Proceedings of the 13th International Conference on Automated Planning and Scheduling, pp. 82\u201391 (2003)"},{"key":"7_CR147","doi-asserted-by":"crossref","unstructured":"Wang, J., Tropper, C.: Optimizing time warp simulation with reinforcement learning techniques. In: Proceedings of the 39th Conference on Winter simulation WSC 2007, pp. 577\u2013584. IEEE Press, Piscataway (2007)","DOI":"10.1109\/WSC.2007.4419650"},{"key":"7_CR148","unstructured":"Watson, J.: Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. Ph.D. thesis, Colorado State University, Fort Collins, CO, USA (2003)"},{"issue":"4","key":"7_CR149","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1145\/235815.235820","volume":"22","author":"S Weerawarana","year":"1996","unstructured":"Weerawarana, S., Houstis, E.N., Rice, J.R., Joshi, A., Houstis, C.E.: PYTHIA: a knowledge-based system to select scientific algorithms. ACM Trans. Math. Softw. 22(4), 447\u2013468 (1996)","journal-title":"ACM Trans. Math. Softw."},{"key":"7_CR150","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-85958-1_21","volume-title":"Principles and Practice of Constraint Programming","author":"W Wei","year":"2008","unstructured":"Wei, W., Li, C.M., Zhang, H.: Switching among non-weighting, clause weighting, and variable weighting in local search for SAT. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 313\u2013326. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-85958-1_21"},{"key":"7_CR151","unstructured":"Wilson, D., Leake, D., Bramley, R.: Case-based recommender components for scientific problem-solving environments. In: Proceedings of the 16th International Association for Mathematics and Computers in Simulation World Congress (2000)"},{"key":"7_CR152","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","volume":"5","author":"DH Wolpert","year":"1992","unstructured":"Wolpert, D.H.: Stacked generalization. Neural Netw. 5, 241\u2013259 (1992)","journal-title":"Neural Netw."},{"key":"7_CR153","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-1-4471-0123-9_3","volume-title":"Soft Computing and Industry","author":"David H. Wolpert","year":"2002","unstructured":"Wolpert, D.H.: The supervised learning no-free-lunch theorems. In: Proceedings of the 6th Online World Conference on Soft Computing in Industrial Applications, pp. 25\u201342 (2001)"},{"issue":"1","key":"7_CR154","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR155","doi-asserted-by":"crossref","unstructured":"Wu, H., van Beek, P.: On portfolios for backtracking search in the presence of deadlines. In: Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence, pp. 231\u2013238. IEEE Computer Society, Washington, DC (2007)","DOI":"10.1109\/ICTAI.2007.38"},{"key":"7_CR156","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H.H., Leyton-Brown, K.: Hierarchical hardness models for SAT. In: CP, pp. 696\u2013711 (2007)","DOI":"10.1007\/978-3-540-74970-7_49"},{"key":"7_CR157","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H.H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: 24th Conference of the Association for the Advancement of Artificial Intelligence (AAAI 2010), pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"7_CR158","doi-asserted-by":"crossref","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla-07: the design and analysis of an algorithm portfolio for SAT. In: CP, pp. 712\u2013727 (2007)","DOI":"10.1007\/978-3-540-74970-7_50"},{"key":"7_CR159","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. (JAIR) 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"7_CR160","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla2009: an automatic algorithm portfolio for SAT. In: 2009 SAT Competition (2009)"},{"key":"7_CR161","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. In: RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI) (2011)"},{"key":"7_CR162","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-31612-8_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"L Xu","year":"2012","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 228\u2013241. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31612-8_18"},{"issue":"10","key":"7_CR163","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/TPDS.2006.131","volume":"17","author":"H Yu","year":"2006","unstructured":"Yu, H., Rauchwerger, L.: An adaptive algorithm selection framework for reduction parallelization. IEEE Trans. Parallel Distrib. Syst. 17(10), 1084\u20131096 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR164","unstructured":"Yu, H., Zhang, D., Rauchwerger, L.: An adaptive algorithm selection framework. In: Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques, pp. 278\u2013289. IEEE Computer Society, Washington, DC (2004)"},{"key":"7_CR165","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-34413-8_23","volume-title":"Proceedings of the 6th International Conference Learning and Intelligent Optimisation LION","author":"X Yun","year":"2012","unstructured":"Yun, X., Epstein, S.L.: Learning algorithm portfolios for parallel execution. In: Hamadi, Y., Schoenauer, M. (eds.) Proceedings of the 6th International Conference Learning and Intelligent Optimisation LION. LNCS, vol. 7219, pp. 323\u2013338. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Data Mining and Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50137-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T01:13:47Z","timestamp":1749777227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50137-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501369","9783319501376"],"references-count":165,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50137-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"3 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}