The design of efficient and generic algorithms for solving combinatorial\noptimization problems has been an active field of research for many years.\nStandard exact solving approaches are based on a clever and complete\nenumeration of the solution set. A critical and non-trivial design choice with\nsuch methods is the branching strategy, directing how the search is performed.\nThe last decade has shown an increasing interest in the design of machine\nlearning-based heuristics to solve combinatorial optimization pr…