{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T18:17:12Z","timestamp":1794421032990,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642298271","type":"print"},{"value":"9783642298288","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_23","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T03:59:40Z","timestamp":1336967980000},"page":"356-361","source":"Crossref","is-referenced-by-count":31,"title":["Guiding Combinatorial Optimization with UCT"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Sabharwal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Horst","family":"Samulowitz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chandra","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2-3","key":"23_CR1","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":"23_CR2","unstructured":"Ciancarini, P., Favini, G.P.: Monte Carlo tree search techniques in the game of Kriegspiel. In: 21st IJCAI, Pasadena, CA, pp. 474\u2013479 (July 2009)"},{"key":"23_CR3","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: 23rd AAAI, Chicago, IL, pp. 259\u2013264 (July 2008)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: 24th ICML, Corvallis, OR, pp. 273\u2013280 (June 2007)","DOI":"10.1145\/1273496.1273531"},{"key":"23_CR5","unstructured":"Gelly, S., Silver, D.: Achieving master level play in 9 \u00d79 computer Go. In: 23rd AAAI, Chicago, IL, pp. 1537\u20131540 (July 2008)"},{"key":"23_CR6","unstructured":"IBM ILOG. IBM CPLEX Optimization Studio 12.3 (2011)"},{"key":"23_CR7","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":"23_CR8","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience (1999)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-21581-0_35","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"A. Previti","year":"2011","unstructured":"Previti, A., Ramanujan, R., Schaerf, M., Selman, B.: Applying UCT to Boolean Satisfiability. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol.\u00a06695, pp. 373\u2013374. Springer, Heidelberg (2011)"},{"key":"23_CR10","unstructured":"Ramanujan, R., Sabharwal, A., Selman, B.: Understanding sampling style adversarial search methods. In: 26th UAI, Catalina Island, CA (July 2010)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Ramanujan, R., Selman, B.: Trade-offs in sampling-based adversarial planning. In: 21st ICAPS, Freiburg, Germany (June 2011)","DOI":"10.1609\/icaps.v21i1.13472"},{"key":"23_CR12","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience (1998)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T14:33:57Z","timestamp":1687444437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_23","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}