## Information-Based Branching Schemes for Binary Linear Mixed Integer Problems

Branching variable selection can greatly affect the effectiveness and efficiency of a branch-and- bound algorithm. Traditional approaches to branching variable selection rely on estimating the effect of the candidate variables on the objective function. We propose an approach which is empowered by exploiting the information contained in a family of fathomed subproblems, collected beforehand from … Read more