2 citations · 3 across the 4 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.OC2021★ 2 cited
A Theoretical and Computational Analysis of Full Strong-Branching
Santanu S. Dey, Yatharth Dubey, Marco Molinaro +1
Full strong-branching is a well-known variable selection rule that is known experimentally to produce significantly smaller branch-and-bound trees in comparison to all other known…
math.OC2021
On Polytopes with Linear Rank with respect to Generalizations of the Split Closure
Sanjeeb Dash, Yatharth Dubey
In this paper we study the rank of polytopes contained in the 0-1 cube with respect to -branch split cuts and -dimensional lattice cuts for a fixed positive integer . Thes…
math.OC2021
Lower Bounds on the Size of General Branch-and-Bound Trees
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
A \emph{general branch-and-bound tree} is a branch-and-bound tree which is allowed to use general disjunctions of the form , wh…