Heuristic Bounds
Heuristic Bounds is a bounding technique in branch and bound algorithms that belongs to the class of estimation methods used to approximate optimal solutions, distinguished by its reliance on heuristic rules to compute bounds that are computationally efficient yet potentially less tight than exact methods.
37
Publications
1.3K
Citations
80
Authors
51
Institutions
Publications per year
2017–2026
3
Parents
37
1–5 of 37
80
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 80
51

Tel Aviv University
Tel Aviv, Israel
3 h-index
4 publications
64 citations

University of Bologna
Bologna, Italy
2 h-index
4 publications
202 citations

Cornell University
Ithaca, United States
2 h-index
3 publications
74 citations
The Ohio State University
Columbus, United States
2 h-index
3 publications
184 citations

Imperial College London
London, United Kingdom
2 h-index
2 publications
138 citations
State University of New York
Albany, United States
1 h-index
2 publications
180 citations
University of Wales
Cardiff, United Kingdom
1 h-index
1 publications
55 citations

University of Turin
Turin, Italy
1 h-index
1 publications
13 citations
1–8 of 51
4 publications · 135 citations
4
h-index
4 publications · 147 citations
4
h-index
2 publications · 137 citations
2
h-index
2 publications · 65 citations
2
h-index
2 publications · 53 citations
2
h-index
1–5