{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:52:51Z","timestamp":1743069171495,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501369"},{"type":"electronic","value":"9783319501376"}],"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_8","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T10:41:48Z","timestamp":1480675308000},"page":"191-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Advanced Portfolio Techniques"],"prefix":"10.1007","author":[{"given":"Barry","family":"Hurley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Kotthoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Malitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"key":"8_CR1","unstructured":"CSP Solver Competition Benchmarks. http:\/\/www.cril.univ-artois.fr\/~lecoutre\/benchmarks.html (2009)"},{"key":"8_CR2","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":"8_CR3","unstructured":"Argelich, J., Li, C., Many\u00e0, F., Planes, J.: Maxsat evaluations (2012). www.maxsat.udl.cat"},{"key":"8_CR4","unstructured":"Audemard, G., Simon, L.: Glucose 2.3 in the SAT 2013 competition. In: Proceedings of SAT Competition 2013, p. 42 (2013)"},{"key":"8_CR5","unstructured":"Biere, A.: Lingeling, plingeling and treengeling entering the SAT competition 2013. In: Proceedings of SAT Competition 2013 (2013)"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.ejor.2011.10.005","volume":"217","author":"A Bortfeldt","year":"2012","unstructured":"Bortfeldt, A., Forster, F.: A tree search procedure for the container pre-marshalling problem. Eur. J. Oper. Res. 217(3), 531\u2013540 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.ejor.2013.10.054","volume":"235","author":"H Carlo","year":"2014","unstructured":"Carlo, H., Vis, I., Roodbergen, K.: Storage yard operations in container terminals: literature overview, trends, and research directions. Eur. J. Oper. Res. 235(2), 412\u2013430 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR8","unstructured":"Data, S.: (2011). http:\/\/www.cs.ubc.ca\/labs\/beta\/Projects\/SATzilla\/"},{"key":"8_CR9","unstructured":"Een, N., S\u00f6rensson, N.: Minisat 2.2 (2013). http:\/\/minisat.se"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: a conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260\u2013265. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-72200-7_23"},{"key":"8_CR11","unstructured":"Gecode Team: Gecode: Generic Constraint Development Environment (2006). http:\/\/www.gecode.org"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Ghahramani, Z., Griffiths, T.L., Sollich, P.: Bayesian nonparametric latent feature models. In: World Meeting on Bayesian Statistics (2006)","DOI":"10.1093\/oso\/9780199214655.003.0008"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: an update. SIGKDD Explor. Newsl. 11(1), 10\u201318 (2009)","journal-title":"SIGKDD Explor. Newsl."},{"key":"8_CR14","unstructured":"Hebrard, E.: Mistral, a constraint satisfaction library. In: Proceedings of the Third International CSP Solver Competition (2008)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-13520-0_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"E Hebrard","year":"2010","unstructured":"Hebrard, E., O\u2019Mahony, E., O\u2019Sullivan, B.: Constraint programming and combinatorial optimisation in numberjack. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 181\u2013185. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13520-0_22"},{"key":"8_CR16","unstructured":"Helmert, M., R\u00f6ger, G., Karpas, E.: Fast downward stone soup: a baseline for building planner portfolios. In: ICAPS (2011)"},{"key":"8_CR17","unstructured":"Hoos, H.: Adaptive novelty+: novelty+ with adaptive noise. In: AAAI (2002)"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985). http:\/\/dx.doi.org\/10.1007\/BF01908075","journal-title":"J. Classif."},{"key":"8_CR19","unstructured":"Hutter, F., Tompkins, D., Hoos, H.: Rsaps: reactive scaling and probabilistic smoothing. In: CP (2002)"},{"key":"8_CR20","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. 6876, pp. 454\u2013469. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-23786-7_35"},{"key":"8_CR21","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC - instance-specific algorithm configuration. In: ECAI, pp. 751\u2013756 (2010)"},{"key":"8_CR22","unstructured":"Kotthoff, L.: LLAMA: leveraging learning to automatically manage algorithms. Technical report, June 2013. arXiv:1306.1031, http:\/\/arxiv.org\/abs\/1306.1031"},{"key":"8_CR23","unstructured":"Le Berre, D., Lynce, I.: CSP2SAT4J: a simple CSP to SAT translator. In: Proceedings of the Second International CSP Solver Competition (2008)"},{"key":"8_CR24","unstructured":"Lecoutre, C., Tabary, S.: Abscon 112, toward more robustness. In: Proceedings of the Third International CSP Solver Competition (2008)"},{"issue":"11","key":"8_CR25","doi-asserted-by":"publisher","first-page":"3295","DOI":"10.1016\/j.cor.2005.12.006","volume":"34","author":"Y Lee","year":"2007","unstructured":"Lee, Y., Hsu, N.: An optimization model for the container pre-marshalling problem. Comput. Oper. Res. 34(11), 3295\u20133313 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.ejor.2014.03.011","volume":"239","author":"J Lehnfeld","year":"2014","unstructured":"Lehnfeld, J., Knust, S.: Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur. J. Oper. Res. 239(2), 297\u2013312 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR27","first-page":"158","volume":"3569","author":"C Li","year":"2005","unstructured":"Li, C., Huang, W.: G2wsat: gradient-based greedy walksat. SAT 3569, 158\u2013172 (2005)","journal-title":"SAT"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-29828-8_16","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"Y Malitsky","year":"2012","unstructured":"Malitsky, Y., Sellmann, M.: Instance-specific algorithm configuration as a method for non-model-based portfolio generation. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 244\u2013259. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-29828-8_16"},{"key":"8_CR29","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: IJCAI (2013)"},{"key":"8_CR30","unstructured":"Manthey, N.: The SAT solver RISS3G at SC 2013. In: Proceedings of SAT Competition 2013, p. 72 (2013)"},{"issue":"10","key":"8_CR31","doi-asserted-by":"publisher","first-page":"838","DOI":"10.4169\/amer.math.monthly.119.10.838","volume":"119","author":"C Martin","year":"2012","unstructured":"Martin, C., Porter, M.: The extraordinary SVD. Math. Assoc. Am. 119(10), 838\u2013851 (2012)","journal-title":"Math. Assoc. Am."},{"key":"8_CR32","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":"8_CR33","unstructured":"Pham, D., Anbulagan: ranov. Solver description. SAT Competition (2007)"},{"key":"8_CR34","unstructured":"Pham, D., Gretton, C.: gnovelty+. Solver description. SAT Competition (2007)"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Prasantha, H.: Image compression using SVD. In: Conference on Computational Intelligence and Multimedia Applications, pp. 143\u2013145 (2007)","DOI":"10.1109\/ICCIMA.2007.386"},{"key":"8_CR36","unstructured":"Prestwich, S.: Vw: Variable weighting scheme. SAT (2005)"},{"issue":"336","key":"8_CR37","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"W Rand","year":"1971","unstructured":"Rand, W.: Objective criteria for the evaluation of clustering methods. J. Am. Statist. Assoc. 66(336), 846\u2013850 (1971)","journal-title":"J. Am. Statist. Assoc."},{"key":"8_CR38","unstructured":"Roussel, O., Lecoutre, C.: XML Representation of Constraint Networks: Format XCSP 2.1. CoRR abs\/0902.2362 (2009)"},{"key":"8_CR39","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1509\/jmr.10.0354","volume":"49","author":"OJ Rutz","year":"2012","unstructured":"Rutz, O.J., Bucklin, R.E., Sonnier, G.P.: A latent instrumental variables approach to modeling keyword conversion in paid search advertising. J. Mark. Res. 49, 306\u2013319 (2012)","journal-title":"J. Mark. Res."},{"key":"8_CR40","unstructured":"Soos, M.: Cryptominisat 2.9.0 (2011)"},{"issue":"1","key":"8_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-007-0100-9","volume":"30","author":"R Stahlbock","year":"2008","unstructured":"Stahlbock, R., Vo\u00df, S.: Operations research at container terminals: a literature update. OR Spectr. 30(1), 1\u201352 (2008)","journal-title":"OR Spectr."},{"key":"8_CR42","unstructured":"Tamura, N., Tanjo, T., Banbara, M.: System description of a SAT-based CSP solver sugar. In: Proceedings of the Third International CSP Solver Competition, pp. 71\u201375 (2009)"},{"key":"8_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-31612-8_37","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"T Tanjo","year":"2012","unstructured":"Tanjo, T., Tamura, N., Banbara, M.: Azucar: a SAT-based CSP solver using compact order encoding. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 456\u2013462. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31612-8_37"},{"key":"8_CR44","unstructured":"Choco team: choco: an Open Source Java Constraint Programming Library (2008)"},{"key":"8_CR45","doi-asserted-by":"crossref","unstructured":"Thornton, J., Pham, D., Bain, S., Ferreira, V.: Additive versus multiplicative clause weighting for SAT. In: PRICAI, pp. 405\u2013416 (2008)","DOI":"10.1007\/978-3-540-89197-0_38"},{"key":"8_CR46","unstructured":"Tierney, K., Pacino, D., Vo\u00df, S.: Solving the pre-marshalling problem to optimality with A* and IDA*. Technical report, WP#1401, DS&OR Lab, University of Paderborn (2014)"},{"key":"8_CR47","unstructured":"Tompkins, D., Hutter, F., Hoos, H.: saps. Solver description. SAT Competition(2007)"},{"key":"8_CR48","unstructured":"Wei, W., Li, C., Zhang, H.: adaptg2wsatp. Solver description. SAT Competition(2007)"},{"key":"8_CR49","unstructured":"Wei, W., Li, C., Zhang, H.: Combining adaptive noise and promising decreasing variables in local search for SAT. Solver description. SAT Competition(2007)"},{"key":"8_CR50","unstructured":"Wei, W., Li, C., Zhang, H.: Deterministic and random selection of variables in local search for sat. Solver description. SAT Competition (2007)"},{"key":"8_CR51","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"8_CR52","unstructured":"Xu, L., Hutter, F., Shen, J., Hoos, H., Leyton-Brown, K.: SATzilla 2012: improved algorithm selection based on cost-sensitive classification models. SAT Competition (2012)"},{"key":"8_CR53","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. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR54","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/s11655-012-1118-7","volume":"18","author":"W Yang","year":"2012","unstructured":"Yang, W., Yi, D., Xie, Y., Tian, F.: Statistical identification of syndromes feature and structure of disease of western medicine based on general latent structure mode. Chin. J. Integr. Med. 18, 850\u2013861 (2012)","journal-title":"Chin. J. Integr. Med."}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:12:55Z","timestamp":1709820775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50137-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501369","9783319501376"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50137-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"3 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}