Branching on nonchimerical fractionalities

We address methods for selecting the branching variable in an enumerative algorithm for Mixed‐Integer Programs, providing heuristics to speed‐up strong branching computation and to reduce the set of variables candidate for branching. Extensive computational results on instances from the literature show that, even in our proof‐of‐concept implementation, a certain speedup can be achieved with respect to state‐of‐the‐art branching strategies.