Estimating the Size of Branch-and-Bound Trees

Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch

Abstract: This paper investigates the problem of estimating the size of branch-and-bound (B&B) trees for solving mixed-integer programs. We first prove that the size of the B&B tree cannot be approximated wi...