Branching Algorithms
Branching Algorithms is a design paradigm in parameterized algorithms that solves problems by recursively reducing an instance to smaller instances through systematic case analysis, distinguished by its use of branching rules to explore solution spaces based on parameterized subproblems.
214
Publications
10.6K
Citations
427
Authors
227
Institutions
Publications per year
2017–2026
45
Parents
214
Handbook of applied optimization
Choice Reviews Online · 2002 · 870 citations
Branch-and-Bound Methods: General Formulation and Properties
L. G. Mitten · Operations Research · 1970 · 331 citations
Learning to Branch in Mixed Integer Programming
Elias B. Khalil, Pierre Le Bodic, Le Song et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 2016 · 304 citations · Full text
1–5 of 214
427
9
h-index
7
h-index
6
h-index
5
h-index
5
h-index
1–5 of 427
227
University of Bergen
Bergen, Norway
8 h-index
20 publications
1.2K citations

Institute of Mathematical Sciences
Chennai, India
8 h-index
15 publications
966 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
10 publications
446 citations
University of Washington
Seattle, United States
6 h-index
10 publications
387 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
13 publications
423 citations

TU Wien
Vienna, Austria
6 h-index
8 publications
186 citations
University of California, Berkeley
Berkeley, United States
5 h-index
7 publications
270 citations
Princeton University
Princeton, United States
5 h-index
5 publications
229 citations
1–8 of 227
9 publications · 449 citations
9
h-index
8 publications · 603 citations
8
h-index
Conference · 7 publications · 504 citations
7
h-index
6 publications · 454 citations
6
h-index
Repository · 6 publications · 107 citations
6
h-index
1–5