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…