{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T16:30:55Z","timestamp":1791217855883,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237850","type":"print"},{"value":"9783642237867","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_35","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"454-469","source":"Crossref","is-referenced-by-count":73,"title":["Algorithm Selection and Scheduling"],"prefix":"10.1007","author":[{"given":"Serdar","family":"Kadioglu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuri","family":"Malitsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Horst","family":"Samulowitz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meinolf","family":"Sellmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Audemard, G., Simon, L.: GLUCOSE: a solver that predicts learnt clauses quality. SAT Competition, 7\u20138 (2009)"},{"key":"35_CR2","unstructured":"Balint, A., Henn, M., Gableske, O.: hybridGM. Solver description. SAT Competition (2009)"},{"key":"35_CR3","unstructured":"Biere, A.: Picosat version 846. Solver description. SAT Competition (2007)"},{"key":"35_CR4","unstructured":"Biere, A.: Pre,icoSATSC 2009. SAT Competition, 41\u201343 (2009)"},{"key":"35_CR5","unstructured":"Biere, A.: Lingeling. SAT Race (2010)"},{"key":"35_CR6","unstructured":"Bregman, D.R.: The SAT Solver MXC, Version 0.99. SAT Competition, 37\u201338 (2009)"},{"issue":"4","key":"35_CR7","doi-asserted-by":"publisher","first-page":"767","DOI":"10.2307\/1911818","volume":"29","author":"G.B. Dantzig","year":"1961","unstructured":"Dantzig, G.B., Wolfe, P.: The decomposition algorithm for linear programs. Econometrica\u00a029(4), 767\u2013778 (1961)","journal-title":"Econometrica"},{"key":"35_CR8","unstructured":"Dequen, G., Dubois, O.: kcnfs. Solver description. SAT Competition (2007)"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-01929-6_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M. Gebser","year":"2009","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Solution Enumeration for Projected Boolean Search Problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 71\u201386. Springer, Heidelberg (2009)"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research\u00a09, 849\u2013859 (1961)","journal-title":"Operations Research"},{"issue":"1-2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm Portfolios. Artificial Intelligence\u00a0126(1-2), 43\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"35_CR12","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: LySAT: solver description. SAT Competition, 23-24 (2009)"},{"key":"35_CR13","unstructured":"Hamerly, G., Elkan, C.: Learning the K in K-Means. NIPS (2003)"},{"key":"35_CR14","unstructured":"Heule, M., van Marren, H.: march hi: solver description. SAT Competition, 27\u201328 (2009)"},{"key":"35_CR15","unstructured":"Heule, M., van Marren, H.: march nn, http:\/\/www.st.ewi.tudelft.nl\/sat\/download.php"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/11527695_26","volume-title":"Theory and Applications of Satisfiability Testing","author":"M. Heule","year":"2005","unstructured":"Heule, M., Zwieten, J., Dufour, M., Maaren, H.: March_eq: implementing additional reasoning into an efficient lookahead SAT solver. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 345\u2013359. Springer, Heidelberg (2005)"},{"key":"35_CR17","first-page":"51","volume":"265","author":"B. Huberman","year":"2003","unstructured":"Huberman, B., Lukose, R., Hogg, T.: An Economics Approach to Hard Computational Problems. Science\u00a0265, 51\u201354 (2003)","journal-title":"Science"},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-46135-3_16","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"F. Hutter","year":"2002","unstructured":"Hutter, F., Tompkins, D.A.D., Hoos, H.H.: Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 233\u2013248. Springer, Heidelberg (2002)"},{"key":"35_CR19","unstructured":"KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: Automatically Building Local Search SAT Solvers From Components. In: IJCAI (2009)"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Lagoudakis, M.G., Littman, M.L.: Learning to select branching rules in the DPLL procedure for satisfiability. In: SAT (2001)","DOI":"10.1016\/S1571-0653(04)00332-4"},{"key":"35_CR21","unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A Portfolio Approach to Algorithm Selection. In: IJCAI, pp. 1542\u20131543 (2003)"},{"key":"35_CR22","unstructured":"Li, C.M., Wei, W.: Combining Adaptive Noise and Promising Decreasing Variables in Local Search for SAT. Solver description. SAT Competition (2009)"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Non-Model-Based Algorithm Portfolios for SAT. SAT (to be published, 2011)","DOI":"10.1007\/978-3-642-21581-0_33"},{"key":"35_CR24","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. Nikolic","year":"2009","unstructured":"Nikolic, M., Maric, F., Janici, P.: Instance Based Selection of Policies for SAT Solvers. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 326\u2013340. Springer, Heidelberg (2009)"},{"key":"35_CR25","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: Irish Conference on Artificial Intelligence and Cognitive Science (2008)"},{"key":"35_CR26","unstructured":"Pham, D.N., Gretton, C.: gnovelty+. Solver description. SAT Competition (2007)"},{"key":"35_CR27","unstructured":"Pham, D.N., Gretton, C.: gnovelty+ (v.2). Solver description. SAT Competition (2009)"},{"key":"35_CR28","doi-asserted-by":"crossref","unstructured":"Rice, J.R.: The algorithm selection problem. Advances in Computers, 65\u2013118 (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"35_CR29","unstructured":"SAT Competition, http:\/\/www.satcomptition.org"},{"key":"35_CR30","doi-asserted-by":"crossref","unstructured":"Silverthorn, B., Miikkulainen, R.: Latent Class Models for Algorithm Portfolio Methods. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7546"},{"key":"35_CR31","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.A.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv.\u00a041(1), 6:1\u20136:25 (2009)","DOI":"10.1145\/1456650.1456656"},{"key":"35_CR32","unstructured":"Soos, M.: CryptoMiniSat 2.5.0. Solver description. SAT Race (2010)"},{"key":"35_CR33","unstructured":"Sorensson, N., Een, N.: MiniSAT 2.2.0 (2010), http:\/\/minisat.se"},{"key":"35_CR34","unstructured":"Streeter, M., Golovin, D., Smith, S.F.: Combining Multiple Heuristics Online. In: AAAI, pp. 1197\u20131203 (2007)"},{"key":"35_CR35","unstructured":"Wei, W., Li, C.M.: Switching Between Two Adaptive Noise Mechanisms in Local Search for SAT. Solver description. SAT Competition (2009)"},{"key":"35_CR36","unstructured":"Wei, W., Li, C.M., Zhang, H.: Combining adaptive noise and promising decreasing variables in local search for SAT. Solver description. SAT Competition (2007)"},{"key":"35_CR37","unstructured":"Wei, W., Li, C.M., Zhang, H.: Deterministic and random selection of variables in local search for SAT. Solver description. SAT Competition (2007)"},{"key":"35_CR38","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H.H., Leyton-Brown, K.: Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"35_CR39","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla2009: an Automatic Algorithm Portfolio for SAT. Solver description. SAT Competition (2009)"},{"issue":"1","key":"35_CR40","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. JAIR\u00a032(1), 565\u2013606 (2008)","journal-title":"JAIR"},{"key":"35_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/978-3-540-74970-7_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Xu","year":"2007","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 712\u2013727. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T02:32:46Z","timestamp":1686277966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}