3 papers
math.OC2026
Linear Threshold for Oertel's Conjecture on the Mixed-Integer Volume
Hongyu Cheng, Amitabh Basu
Grünbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least : every halfspace containing the centroid captures at least a fraction o…
math.OC2026
Theoretical Challenges in Learning for Branch-and-Cut
Hongyu Cheng, Amitabh Basu
Machine learning is increasingly used to guide branch-and-cut (B&C) for mixed-integer linear programming by learning score-based policies for selecting branching variables and cutt…
cs.LG2025
Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
Hongyu Cheng, Amitabh Basu
Mixed-integer programming (MIP) provides a powerful framework for optimization problems, with Branch-and-Cut (B&C) being the predominant algorithm in state-of-the-art solvers. The…