An Abstract Model for Branch and Cut

Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan

Branch and cut is the dominant paradigm for solving a wide range of mathematical programming problems -- linear or nonlinear -- combining efficient search (via branch and bound) an…