Tree Search and Simulation
暂无分享,去创建一个
[1] João Pedro Pedroso,et al. Tree search for the stacking problem , 2013, Ann. Oper. Res..
[2] Mordecai Avriel,et al. Container ship stowage problem: complexity and connection to the coloring of circle graphs , 2000, Discret. Appl. Math..
[3] Neil D. Lawrence,et al. Missing Data in Kernel PCA , 2006, ECML.
[4] Andrew V. Goldberg,et al. Exact Combinatorial Branch-and-Bound for Graph Bisection , 2012, ALENEX.
[5] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[6] Bruno Bouzy,et al. Associating Shallow and Selective Global Tree Search with Monte Carlo for 9*9 Go , 2004, Computers and Games.
[7] Stefan Voß,et al. Applying the corridor method to a blocks relocation problem , 2011, OR Spectr..
[8] Mhand Hifi,et al. A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies , 2009, Adv. Oper. Res..
[9] Stephan Mertens. The Easiest Hard Problem: Number Partitioning , 2006, Computational Complexity and Statistical Physics.
[10] Kap Hwan Kim,et al. A heuristic rule for relocating blocks , 2006, Comput. Oper. Res..
[11] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[12] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.
[13] Mordecai Avriel,et al. Stowage planning for container ships to reduce the number of shifts , 1998, Ann. Oper. Res..
[14] Ashish Sabharwal,et al. Guiding Combinatorial Optimization with UCT , 2012, CPAIOR.
[15] Kap Hwan Kim,et al. Container Terminals and Cargo Systems , 2007 .
[16] Alberto Caprara,et al. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming , 2010, IPCO.
[17] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[18] János D. Pintér,et al. Solving circle packing problems by global optimization: Numerical results and industrial applications , 2008, Eur. J. Oper. Res..
[19] João Nuno Tavares,et al. Recursive circle packing problems , 2016, Int. Trans. Oper. Res..
[20] Sönke Hartmann,et al. A general framework for scheduling equipment and manpower at container terminals , 2004, OR Spectr..
[21] Michèle Sebag,et al. The grand challenge of computer Go , 2012, Commun. ACM.
[22] Pascal Vasseur,et al. A Branch-and-Bound Approach to Correspondence and Grouping Problems , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[23] Jordan B. Pollack,et al. Methods for statistical inference: extending the evolutionary computation paradigm , 1999 .
[24] Rémi Coulom,et al. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.
[25] Mark H. M. Winands,et al. Monte-Carlo Tree Search Solver , 2008, Computers and Games.
[26] Kazunori Yamaguchi,et al. Evaluation of Monte Carlo tree search and the application to Go , 2008, 2008 IEEE Symposium On Computational Intelligence and Games.
[27] Kenneth Stephenson. Circle Packing : A Mathematical Tale , 2003 .
[28] Matteo Fischetti,et al. Exploiting Erraticism in Search , 2014, Oper. Res..
[29] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[30] Matthew L. Ginsberg,et al. Iterative Broadening , 1990, Artif. Intell..
[31] R. A. Cuninghame-Green,et al. Packing and Covering in Combinatorics , 1980 .
[32] Zongmin Ma,et al. Computers and Games , 2008, Lecture Notes in Computer Science.
[33] Bart Selman,et al. Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.
[34] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.
[35] João Pedro Pedroso,et al. Heuristics and exact methods for number partitioning , 2010, Eur. J. Oper. Res..
[36] Richard E. Korf,et al. A Complete Anytime Algorithm for Number Partitioning , 1998, Artif. Intell..
[37] Simon M. Lucas,et al. A Survey of Monte Carlo Tree Search Methods , 2012, IEEE Transactions on Computational Intelligence and AI in Games.
[38] T. C. Edwin Cheng,et al. A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs , 2010, Comput. Oper. Res..
[39] Cevdet Aykanat,et al. Iterative-improvement-based declustering heuristics for multi-disk databases , 2005, Inf. Syst..
[40] Fred W. Glover,et al. A new modeling and solution approach for the number partitioning problem , 2005, Adv. Decis. Sci..
[41] Rommert Dekker,et al. Advanced methods for container stacking , 2006, OR Spectr..
[42] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[43] Richard M. Karp,et al. The Differencing Method of Set Partitioning , 1983 .
[44] S. Mertens. Phase Transition in the Number Partitioning Problem , 1998, cond-mat/9807077.