{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T06:03:53Z","timestamp":1743573833070,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319150321"},{"type":"electronic","value":"9783319150338"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15033-8_4","type":"book-chapter","created":{"date-parts":[[2015,4,6]],"date-time":"2015-04-06T14:35:52Z","timestamp":1428330952000},"page":"109-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Tree Search and Simulation"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o Pedro","family":"Pedroso","sequence":"first","affiliation":[]},{"given":"Rui","family":"Rei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28 (1960) 497\u2013520","DOI":"10.2307\/1910129"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: A survey. Operations Research 14 (1966) 699\u2013719","DOI":"10.1287\/opre.14.4.699"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Buchheim, C., Caprara, A., Lodi, A.: An effective branch-and-bound algorithm for convex quadratic integer programming. Mathematical Programming 135 (2012) 369\u2013395","DOI":"10.1007\/s10107-011-0475-x"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ng, C., Wang, J.B., Cheng, T.E., Liu, L.: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Computers & Operations Research 37 (2010) 83\u201390","DOI":"10.1016\/j.cor.2009.03.019"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bazin, J., Li, H., Kweon, I.S., Demonceaux, C., Vasseur, P., Ikeuchi, K.: A branch-and-bound approach to correspondence and grouping problems. IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2013) 1565\u20131576","DOI":"10.1109\/TPAMI.2012.264"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Exact combinatorial branch-and-bound for graph bisection. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX\u201912), Society for Industrial and Applied Mathematics (2012) 30\u201344","DOI":"10.1137\/1.9781611972924.3"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Ginsberg, M.L., Harvey, W.D.: Iterative broadening. Artificial Intelligence 55 (1992) 367\u2013383","DOI":"10.1016\/0004-3702(92)90059-7"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4 (1968) 100\u2013107","DOI":"10.1109\/TSSC.1968.300136"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Korf, R.: Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27 (1985) 97\u2013109","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24 (2000) 67\u2013100","DOI":"10.1023\/A:1006314320276"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Monaci, M.: Exploiting erraticism in search. Operations Research 62 (2014) 114\u2013122","DOI":"10.1287\/opre.2013.1231"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Bouzy, B.: Associating shallow and selective global tree search with Monte Carlo for 9$$\\times $$ 9 Go. In: Computers and Games. Springer (2006) 67\u201380","DOI":"10.1007\/11674399_5"},{"key":"4_CR13","unstructured":"Juille, H.R.: Methods for Statistical Inference: Extending the Evolutionary Computation Paradigm. PhD thesis, Waltham, MA, USA (1999)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: Proceedings of the 5th International Conference on Computers and Games. CG\u201906, Berlin, Heidelberg, Springer-Verlag (2007) 72\u201383","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Winands, M.H., Bj\u00f6rnsson, Y., Saito, J.T.: Monte-Carlo tree search solver. In: Computers and Games. Springer (2008) 25\u201336","DOI":"10.1007\/978-3-540-87608-3_3"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Takeuchi, S., Kaneko, T., Yamaguchi, K.: Evaluation of Monte Carlo tree search and the application to Go. In: 2008 IEEE Symposium On Computational Intelligence and Games (CIG), IEEE (2008) 191\u2013198","DOI":"10.1109\/CIG.2008.5035639"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Gelly, S., Kocsis, L., Schoenauer, M., Sebag, M., Silver, D., Szepesv\u00e1ri, C., Teytaud, O.: The grand challenge of computer Go: Monte Carlo tree search and extensions. Communications of the ACM 55 (2012) 106\u2013113","DOI":"10.1145\/2093548.2093574"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Browne, C.B., Powley, E., Whitehouse, D., Lucas, S.M., Cowling, P.I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo tree search methods. IEEE Transactions on Computational Intelligence and AI in Games 4 (2012) 1\u201343","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Sabharwal, A., Samulowitz, H., Reddy, C.: Guiding combinatorial optimization with UCT. In: Proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2012), Springer (2012) 356\u2013361","DOI":"10.1007\/978-3-642-29828-8_23"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M., eds.: Machine Learning: ECML 2006. Volume 4212 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg (2006) 282\u2013293","DOI":"10.1007\/11871842_29"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47 (2002) 235\u2013256","DOI":"10.1023\/A:1013689704352"},{"key":"4_CR22","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman, New York (1979)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Mertens, S.: The easiest hard problem: Number partitioning. In Percus, A., Istrate, G., Moore, C., eds.: Computational Complexity and Statistical Physics, New York, Oxford University Press (2006) 125\u2013139","DOI":"10.1093\/oso\/9780195177374.003.0012"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Mertens, S.: Phase transition in the number partitioning problem. Physical Review Letters 81 (1998) 4281\u20134284","DOI":"10.1103\/PhysRevLett.81.4281"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Alidaee, B., Glover, F., Kochenberger, G.A., Rego, C.: A new modeling and solution approach for the number partitioning problem. Journal of Applied Mathematics and Decision Sciences 9 (2005) 113\u2013121","DOI":"10.1155\/JAMDS.2005.113"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Koyut\u00fcrk, M., Aykanat, C.: Iterative-improvement-based declustering heuristics for multi-disk databases. Information Systems 30 (2005) 47\u201370","DOI":"10.1016\/j.is.2003.08.003"},{"key":"4_CR27","unstructured":"Karmarkar, N., Karp, R.: The differencing method of set partitioning. Technical Report UCB\/CSD 82\/113, University of California - Berkeley, Computer Science Division (1982)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Korf, R.E.: A complete anytime algorithm for number partitioning. Artificial Intelligence 106 (1998) 181\u2013203","DOI":"10.1016\/S0004-3702(98)00086-1"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Pedroso, J.P., Kubo, M.: Heuristics and exact methods for number partitioning. European Journal of Operational Research 202 (2010) 73\u201381","DOI":"10.1016\/j.ejor.2009.04.027"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Dekker, R., Voogd, P., Asperen, E.: Advanced methods for container stacking. In Kim, K.H., G\u00fcnther, H.O., eds.: Container Terminals and Cargo Systems. Springer, Berlin Heidelberg (2007) 131\u2013154","DOI":"10.1007\/978-3-540-49550-5_7"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Hartmann, S.: A general framework for scheduling equipment and manpower at container terminals. OR Spectrum 26 (2004) 51\u201374","DOI":"10.1007\/s00291-003-0149-z"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Avriel, M., Penn, M., Shpirer, N.: Container ship stowage problem: Complexity and connection to the coloring of circle graphs. Discrete Applied Mathematics 103 (2000) 271\u2013279","DOI":"10.1016\/S0166-218X(99)00245-0"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research 76 (1998) 55\u201371","DOI":"10.1023\/A:1018956823693"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Rei, R.J., Pedroso, J.P.: Tree search for the stacking problem. Annals of Operations Research 203 (2013) 371\u2013388","DOI":"10.1007\/s10479-012-1186-2"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Computers and Operations Research 33 (2006) 940\u2013954","DOI":"10.1016\/j.cor.2004.08.005"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Caserta, M., Vo\u00df, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectrum 33 (2011) 915\u2013929","DOI":"10.1007\/s00291-009-0176-5"},{"key":"4_CR37","doi-asserted-by":"publisher","unstructured":"Pedroso, J.P., Cunha, S., Tavares, J.N.: Recursive circle packing problems. International Transactions in Operational Research (2014). doi:10.1111\/itor.12107","DOI":"10.1111\/itor.12107"},{"key":"4_CR38","unstructured":"Lenstra, J., Rinnooy Kan, A.: Complexity of packing, covering, and partitioning problems. In Schrijver, A., ed.: Packing and Covering in Combinatorics. Mathematisch Centrum, Amsterdam (1979) 275\u2013291"},{"key":"4_CR39","unstructured":"Stephenson, K.: Circle packing: A mathematical tale. Notices of the American Mathematical Society 50 (2003) 1376\u20131388"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Hifi, M., M\u2019Hallah, R.: A literature review on circle and sphere packing problems: Models and methodologies. Advances in Operations Research 2009 (2009) 1\u201322","DOI":"10.1155\/2009\/150624"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Castillo, I., Kampas, F.J., Pint\u00e9r, J.D.: Solving circle packing problems by global optimization: Numerical results and industrial applications. European Journal of Operational Research 191 (2008) 786\u2013802","DOI":"10.1016\/j.ejor.2007.01.054"}],"container-title":["Applied Simulation and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15033-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T10:34:31Z","timestamp":1675852471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15033-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319150321","9783319150338"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15033-8_4","relation":{},"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}