Mixed Integer Programming (MIP) is NP-hard, and yet modern solvers often solve large real-world problems within minutes. This success can partially be attributed to heuristics. Since their behavior highly instance-dependent, relying on hard-coded rules derived from empirical testing a heterogeneous corpora of benchmark instances might lead sub-optimal performance. In this work, we propose an on...