'Extract from Gurobi or CPLEX the ranking of variables according to the strong branching strategy?

I am trying to recreate what is done in Learning to Branch in Mixed Integer Programming, Khalil et al (AAAI 2016), but cannot find their implementation. Namely, I am interested in knowing the ranking of variables in a node according to the Strong branching and Pseudocost branching strategies. Is it possible to extract this information from Gurobi or CPLEX from Python API? Or I have to calculate them myself? If the latter, could someone point to an efficient way of doing it?

cplexgurobimixed-integer-programming


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions