TITLE: Online Estimation of the Size of the Branch and Bound Tree in MIP Solvers

ABSTRACT: 

We present an online method that estimates the final size of the branch-and-bound tree in Mixed-Integer Programming solvers. The method combines an old sampling method due to Knuth (1975) and recent work on branching by Le Bodic and Nemhauser (2017). This method is implemented in the MIP solver SCIP and its results are displayed as an extra column. This is joint work with Gleb Belov, Samuel Esler, Dylan Fernando and George Nemhauser.

BIO: Pierre Le Bodic, Lecturer at Monash University, Melbourne, Australia