Search Tree Enumeration is a backtracking algorithmic method that systematically generates all possible solutions in a problem space by traversing a search tree in a depth-first manner, where each node represents a partial solution and each path from the root to a leaf corresponds to a complete candidate solution.
41
Publications
2.6K
Citations
111
Authors
62
Institutions
Publications per year
2017–2026
7
Parents
Publications
41
Reverse search for enumeration
David Avis, Komei Fukuda · Discrete Applied Mathematics · 1996 · 760 citations
1–5 of 41
Authors
111
- SY
2
h-index
- WC
2
h-index
- JT
2
h-index
- CD
2
h-index
- JH
2
h-index
1–5 of 111
Institutions
62
Tsinghua University
Beijing, China
3 h-index
14 publications
472 citations
McGill University
Montreal, Canada
3 h-index
3 publications
900 citations
University of Alberta
Edmonton, Canada
2 h-index
2 publications
74 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
6 publications
114 citations
Institute of Microelectronics
Beijing, China
2 h-index
12 publications
444 citations
North Dakota State University
Fargo, United States
2 h-index
3 publications
85 citations
Kırıkkale University
Kırıkkale, Türkiye
1 h-index
1 publications
18 citations
Otsuka (Japan)
Tokyo, Japan
1 h-index
1 publications
760 citations
1–8 of 62
Venues
- European Journal of Operational Research
5 publications · 201 citations
5
h-index
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
2 publications · 95 citations
2
h-index
- Journal of Computational Biology
2 publications · 161 citations
2
h-index
- Computers & Chemical Engineering
1 publications · 10 citations
1
h-index
- The Journal of Chemical Physics
1 publications · 29 citations
1
h-index
1–5