2 citations · 3 across the 4 of their papers we have counts for
7 papers
Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization
Gérard Cornuéjols, Yatharth Dubey
In this paper, we consider a theoretical framework for comparing branch-and-bound with classical lift-and-project hierarchies. We simplify our analysis of streamlining the definiti…
On the Smallest Support Size of Integer Solutions to Linear Equations
Yatharth Dubey, Siyue Liu
In this note, we study the size of the support of integer solutions to linear equations where . We give an upper bound on the smalle…
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…
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…
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…
Branch-and-Bound Solves Random Binary IPs in Polytime
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Branch-and-bound is the workhorse of all state-of-the-art mixed integer linear programming (MILP) solvers. These implementations of branch-and-bound typically use variable branchin…
The Power of The Hybrid Model for Mean Estimation
Brendan Avent, Yatharth Dubey, Aleksandra Korolova
We explore the power of the hybrid model of differential privacy (DP), in which some users desire the guarantees of the local model of DP and others are content with receiving the…