Python-MIP 1.11.0

• Two additional parameters, three depth and pass number, are now informed to the generage_constrs method in ConstrsGenerator class (which is used for cut/lazy constraints callbacks). Thus, strategies that generate more/less cuts at a given depth can use this information. See here .

• Cut generators: additional cut generators can now be called at the root node in customized cutting planes algorithms, see here .

• Instance features: it is now possible to query a vector of instance features. These features can be used in machine learning algorithms, for example, to decide the best parameter settings. Basic features are just the problems dimensions, e.g.: columns, rows, non-zeros. The current implementation extracts 208 instance features. To see an implementation of algorithm selection that is used in the COIN-OR Linear Programming Solver (CLP) check: Vilas Boas, M.G., Santos, H.G., Merschmann, L.H.C. and Vanden Berghe, G. Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches. International Transactions in Operational Research, DOI 10.1111/itor.12724. 2019.