Bounding Functions
Bounding Functions is a mathematical procedure in optimization that belongs to the class of node evaluation techniques within Branch and Bound algorithms, distinguished by its role in computing lower or upper bounds on the optimal solution of subproblems to prune non-promising branches in the search tree.
580
Publications
32.8K
Citations
1.1K
Authors
559
Institutions
Publications per year
2017–2026
64
Variants
Bound Functions
Parents
580
A robust adaptive nonlinear control design
Marios M. Polycarpou, Pétros Ioannou · Automatica · 1996 · 935 citations
A guided tour of chernoff bounds
Torben Hagerup, Christine Rüb · Information Processing Letters · 1990 · 525 citations
1–5 of 580
1.1K
4
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 1.1K
559
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
21 publications
804 citations

Centre National de la Recherche Scientifique
Paris, France
10 h-index
16 publications
606 citations
University of California, Berkeley
Berkeley, United States
8 h-index
15 publications
4.8K citations
Columbia University
New York, United States
8 h-index
8 publications
306 citations

University of Bologna
Bologna, Italy
8 h-index
17 publications
1.1K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
7 h-index
12 publications
522 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
9 publications
343 citations
AT&T (United States)
Bedminster, United States
6 h-index
7 publications
247 citations
1–8 of 559
17 publications · 973 citations
15
h-index
13 publications · 642 citations
13
h-index
11 publications · 784 citations
11
h-index
11 publications · 254 citations
10
h-index
9 publications · 472 citations
9
h-index
1–5