{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:10:37Z","timestamp":1781014237884,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642335570","type":"print"},{"value":"9783642335587","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_38","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:32:47Z","timestamp":1349231567000},"page":"512-526","source":"Crossref","is-referenced-by-count":13,"title":["Parallel SAT Solver Selection and Scheduling"],"prefix":"10.1007","author":[{"given":"Yuri","family":"Malitsky","sequence":"first","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":"38_CR1","unstructured":"SAT Competition, http:\/\/www.satcomptition.org"},{"key":"38_CR2","unstructured":"Biere, A.: Lingeling, plingeling, picosat and precosat at sat race 2010. Technical report, Johannes Kepler University, Linz, Austria (2010)"},{"key":"38_CR3","unstructured":"Biere, A.: Lingeling and friends at the sat competition 2011. Technical report, Johannes Kepler University, Altenbergerstr. 69, 4040 Linz, Austria (2011)"},{"key":"38_CR4","volume-title":"Linear programming and extensions","author":"G. Dantzig","year":"1963","unstructured":"Dantzig, G.: Linear programming and extensions. Princeton University Press, Princeton (1963)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Een, N., Sorensson, N.: An extensible sat-solver [ver 1.2] (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/SAT190070","volume":"6","author":"Y. Hamadi","year":"2009","unstructured":"Hamadi, Y., Jabbour, S., Lakhdar, S.: Manysat: a parallel sat solver. Journal on Satisfiability, Boolean Modeling and Computation\u00a06, 245\u2013262 (2009)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-23786-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S. Kadioglu","year":"2011","unstructured":"Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm Selection and Scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 454\u2013469. Springer, Heidelberg (2011)"},{"key":"38_CR8","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":"38_CR9","doi-asserted-by":"crossref","unstructured":"Petrik, M., Zilberstein, S.: Learning static parallel portfolios of algorithms. In: Ninth International Symposium on Artificial Intelligence and Mathematics (2006)","DOI":"10.1007\/s10472-007-9050-9"},{"key":"38_CR10","unstructured":"Roussel, O.: Description of ppfolio (2011), http:\/\/www.cril.univ-artois.fr\/~roussel\/ppfolio\/solver1.pdf"},{"key":"38_CR11","unstructured":"Soos, M.: Cryptominisat 2.9.0 (2011)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Stern, D., Samulowitz, H., Herbrich, R., Graepel, T., Pulina, L., Tacchella, A.: Collaborative expert portfolio management. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7561"},{"key":"38_CR13","unstructured":"Streeter, M., Smith, S.: Using decision procedures efficiently for optimization. In: ICAPS, pp. 312\u2013319 (2007)"},{"issue":"1","key":"38_CR14","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., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for sat. JAIR\u00a032(1), 565\u2013606 (2008)","journal-title":"JAIR"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Yun, X., Epstein, S.: Learning algorithm portfolios for parallel execution. In: Workshop on Learning and Intelligent Optimization (2012)","DOI":"10.1007\/978-3-642-34413-8_23"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T01:43:16Z","timestamp":1687743796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}