Current Projects

• Branch-and-Bound with Predictions for Variable Selection

• Empirical Hardness Models for Branch-and-Bound via Graph Neural Networks

Papers

• Branch-and-Bound versus Lift-and-Project Relaxations for Combinatorial Optimization
  with Gérard Cornuéjols.
  Submitted to Conference on Integer Programming and Combinatorial Optimization (IPCO)

• A Short Proof of Tight Bounds on the Smallest Support Size of Integer Solutions to Linear Equations
  with Siyue Liu.
  Accepted with minor revision at Mathematical Programming

• A Theoretical and Computational Analysis of Full Strong-Branching
  with Santanu S. Dey, Marco Molinaro, and Prachi Shah.
  Mathematical Programming (2023)

• On Polytopes with Linear Rank with respect to Generalizations of the Split Closure
  with Sanjeeb Dash.
  Minor revision at Discrete Optimization

• Lower Bounds on the Size of General Branch-and-Bound Trees
  with Santanu S. Dey and Marco Molinaro.
  Mathematical Programming (2022)

• Branch-and-Bound Solves Random Binary IPs in Polytime
  with Santanu S. Dey and Marco Molinaro.
  Mathematical Programming (2022)
  Earlier version in Symposium on Discrete Algorithms (SODA) 2021 (invited to special issue of TALG)

• The Power of the Hybrid Model of Differential Privacy for Mean Estimation
  with Brendan Avent and Aleksandra Korolova.
  Privacy Enhancing Technologies Symposium (PETS) 2020