3 papers
math.OC2023
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…
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…
cs.CR2018
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…