{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T12:52:25Z","timestamp":1752670345852},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_36","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T03:11:01Z","timestamp":1378523461000},"page":"464-480","source":"Crossref","is-referenced-by-count":17,"title":["Bandit-Based Search for Constraint Programming"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Loth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mich\u00e8le","family":"Sebag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youssef","family":"Hamadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Schoenauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S1574-6526(06)80008-8","volume-title":"Handbook of Constraint Programming (Foundations of Artificial Intelligence)","author":"P. van Beek","year":"2006","unstructured":"van Beek, P.: Backtracking Search Algorithms. In: Handbook of Constraint Programming (Foundations of Artificial Intelligence), pp. 85\u2013134. Elsevier Science Inc., New York (2006)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Rice, J.: The algorithm selection problem. In: Advances in Computers, pp. 65\u2013118 (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"36_CR3","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, 565\u2013606 (2008)","journal-title":"JAIR"},{"key":"36_CR4","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: AICS (2008)"},{"key":"36_CR5","unstructured":"Samulowitz, H., Memisevic, R.: Learning to solve QBF. In: AAAI, 255\u2013260 (2007)"},{"key":"36_CR6","unstructured":"Streeter, M., Golovin, D., Smith, S.: Combining multiple heuristics online. In: AAAI, pp. 1197\u20131203 (2007)"},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","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. Intell. Res (JAIR)\u00a036, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Sutton, R., Barto, A.: Reinforcement Learning: an introduction. MIT Press (1998)","DOI":"10.1109\/TNN.1998.712192"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-23954-0_18","volume-title":"AI*IA 2011: Artificial Intelligence Around Man and Beyond","author":"A. Previti","year":"2011","unstructured":"Previti, A., Ramanujan, R., Schaerf, M., Selman, B.: Monte-carlo style UCT search for boolean satisfiability. In: Pirrone, R., Sorbello, F. (eds.) AI*IA 2011. LNCS, vol.\u00a06934, pp. 177\u2013188. Springer, Heidelberg (2011)"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-34413-8_12","volume-title":"Learning and Intelligent Optimization","author":"T.P. Runarsson","year":"2012","unstructured":"Runarsson, T.P., Schoenauer, M., Sebag, M.: Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, vol.\u00a07219, pp. 160\u2013174. Springer, Heidelberg (2012)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-29828-8_23","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"A. Sabharwal","year":"2012","unstructured":"Sabharwal, A., Samulowitz, H., Reddy, C.: Guiding combinatorial optimization with UCT. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 356\u2013361. Springer, Heidelberg (2012)"},{"key":"36_CR12","volume-title":"Learning and Intelligent Optimization Conference (LION 7)","author":"M. Loth","year":"2013","unstructured":"Loth, M.: Hybridizing constraint programming and Monte-Carlo Tree Search: Application to the job shop problem. In: Nicosia, G., Pardalos, P. (eds.) Learning and Intelligent Optimization Conference (LION 7). Springer, Heidelberg (2013)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T. Lai","year":"1985","unstructured":"Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics\u00a06, 4\u201322 (1985)","journal-title":"Advances in Applied Mathematics"},{"issue":"2-3","key":"36_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"36_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based monte-carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: International Conference on Machine Learning, pp. 273\u2013280. ACM (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"36_CR17","unstructured":"Ciancarini, P., Favini, G.: Monte-Carlo Tree Search techniques in the game of Kriegspiel. In: International Joint Conference on Artificial Intelligence, pp. 474\u2013479 (2009)"},{"key":"36_CR18","unstructured":"Nakhost, H., M\u00fcller, M.: Monte-Carlo exploration for deterministic planning. In: Boutilier, C. (ed.) International Joint Conference on Artificial Intelligence, pp. 1766\u20131771 (2009)"},{"issue":"4","key":"36_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. Information Processing Letters\u00a047(4), 173\u2013180 (1993)","journal-title":"Information Processing Letters"},{"key":"36_CR20","unstructured":"Gecode Team: Gecode: Generic constraint development environment (2012),\n                    \n                      www.gecode.org"},{"key":"36_CR21","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"J.C. Beck","year":"2007","unstructured":"Beck, J.C.: Solution-guided multi-point constructive search for job shop scheduling. Journal of Artificial Intelligence Research\u00a029, 49\u201377 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"36_CR22","first-page":"275","volume":"26","author":"R. Mathon","year":"1985","unstructured":"Mathon, R., Rosa, A.: Tables of parameters for BIBD\u2019s with r\u2009\u2264\u200941 including existence, enumeration, and resolvability results. Ann. Discrete Math.\u00a026, 275\u2013308 (1985)","journal-title":"Ann. Discrete Math."},{"key":"36_CR23","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., Leyton-Brown, K.: Performance prediction and automated tuning of randomized and parametric algorithms. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 213\u2013228. Springer, Heidelberg (2006)"},{"key":"36_CR24","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.\u00a05584, pp. 312\u2013325. Springer, Heidelberg (2009)"},{"key":"36_CR25","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":"S.. Epstein","year":"2002","unstructured":"Epstein, S., Freuder, E., Wallace, R., Morozov, A., Samuels, B.: The adaptive constraint engine. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 525\u2013540. Springer, Heidelberg (2002)"},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"Wu, H., Van Beek, P.: Portfolios with deadlines for backtracking search. In: IJAIT, vol.\u00a017, pp. 835\u2013856 (2008)","DOI":"10.1142\/S0218213008004187"},{"key":"36_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-34413-8_14","volume-title":"Learning and Intelligent Optimization","author":"M. Schneider","year":"2012","unstructured":"Schneider, M., Hoos, H.H.: Quantifying homogeneity of instance sets for algorithm configuration. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, vol.\u00a07219, pp. 190\u2013204. Springer, Heidelberg (2012)"},{"key":"36_CR28","unstructured":"Wang, Y., Audibert, J., Munos, R.: Algorithms for infinitely many-armed bandits. In: Advances in Neural Information Processing Systems, pp. 1\u20138 (2008)"},{"key":"36_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P. Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"36_CR30","unstructured":"Harvey, W., Ginsberg, M.: Limited discrepancy search. In: International Joint Conference on Artificial Intelligence, pp. 607\u2013615 (1995)"},{"issue":"2","key":"36_CR31","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064(2), 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"36_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-540-48085-3_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"I. Gent","year":"1999","unstructured":"Gent, I., Walsh, T.: Csplib: A benchmark library for constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 480\u2013481. Springer, Heidelberg (1999)"},{"issue":"2","key":"36_CR33","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(93)E0127-K","volume":"58","author":"F. Werner","year":"1995","unstructured":"Werner, F., Winkler, A.: Insertion techniques for the heuristic solution of the job shop problem. Discrete Applied Mathematics\u00a058(2), 191\u2013211 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR34","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, pp. 146\u2013150 (2004)"},{"issue":"1","key":"36_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.1100.0388","volume":"23","author":"J. Beck","year":"2011","unstructured":"Beck, J., Feng, T., Watson, J.P.: Combining constraint programming and local search for job-shop scheduling. INFORMS Journal on Computing\u00a023(1), 1\u201314 (2011)","journal-title":"INFORMS Journal on Computing"},{"key":"36_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"L. Michel","year":"2012","unstructured":"Michel, L., Van Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 228\u2013243. Springer, Heidelberg (2012)"},{"key":"36_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-24664-0_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"L. Perron","year":"2004","unstructured":"Perron, L., Shaw, P.: Combining forces to solve the car sequencing problem. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 225\u2013239. Springer, Heidelberg (2004)"},{"key":"36_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R. Coulom","year":"2007","unstructured":"Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"36_CR39","first-page":"1655","volume":"12","author":"S. Bubeck","year":"2011","unstructured":"Bubeck, S., Munos, R., Stoltz, G., Szepesv\u00e1ri, C.: X-armed bandits. Journal of Machine Learning Research\u00a012, 1655\u20131695 (2011)","journal-title":"Journal of Machine Learning Research"},{"key":"36_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-87608-3_6","volume-title":"Computers and Games","author":"G.M.J.-B. Chaslot","year":"2008","unstructured":"Chaslot, G.M.J.-B., Winands, M.H.M., van den Herik, H.J.: Parallel Monte-Carlo Tree Search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol.\u00a05131, pp. 60\u201371. Springer, Heidelberg (2008)"},{"key":"36_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-04244-7_20","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"G. Chu","year":"2009","unstructured":"Chu, G., Schulte, C., Stuckey, P.: Confidence-based work stealing in parallel constraint programming. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 226\u2013241. Springer, Heidelberg (2009)"}],"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-40627-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T22:10:09Z","timestamp":1558044609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}