Search Tree Pruning is a computational optimization strategy within the Branch and Bound framework that selectively eliminates subtrees from further exploration by determining that they cannot contain an optimal solution, thereby reducing the search space without compromising solution optimality.
166
Publications
30.5K
Citations
415
Authors
208
Institutions
Publications per year
2017–2026
36
Parents
Publications
166
Mastering the game of Go with deep neural networks and tree search
David Silver, Aja Huang, Chris J. Maddison et al. · Nature · 2016 · 15.8K citations
GRASP - A New Search Algorithm for Satisfiability
1996 · 860 citations
1–5 of 166
Authors
415
- KA
4
h-index
- RE
3
h-index
- JS
3
h-index
- BS
3
h-index
- CL
2
h-index
1–5 of 415
Institutions
208
University of Michigan
Ann Arbor, United States
6 h-index
9 publications
2K citations
California Institute of Technology
Pasadena, United States
4 h-index
10 publications
300 citations
University of Alberta
Edmonton, Canada
4 h-index
7 publications
202 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
5 publications
585 citations
University of California, Berkeley
Berkeley, United States
3 h-index
6 publications
124 citations
Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
8 publications
239 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
3 publications
250 citations
Beihang University
Beijing, China
3 h-index
6 publications
264 citations
1–8 of 208
Venues
- National Conference on Artificial Intelligence
Conference · 5 publications · 273 citations
5
h-index
- INFORMS journal on computing
4 publications · 155 citations
4
h-index
- Artificial Intelligence
4 publications · 1.5K citations
4
h-index
- arXiv (Cornell University)
Repository · 4 publications · 214 citations
4
h-index
- Proceedings of the International Symposium on Combinatorial Search
3 publications · 96 citations
3
h-index
1–5