On learning and branching: a survey

This paper surveys learning techniques to deal with the two most crucial decisions in the branch‐and‐bound algorithm for Mixed‐Integer Linear Programming, namely variable and node selections. Because of the lack of deep mathematical understanding on those decisions, the classical and vast literature in the field is inherently based on computational studies and heuristic, often problem‐specific, strategies. We will both interpret some of those early contributions in the light of modern (machine) learning techniques, and give the details of the recent algorithms that instead explicitly incorporate machine learning paradigms.