4 citations · 10 across the 6 of their papers we have counts for
3 papers · 1 filter
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…
An Abstract Model for Branching and its Application to Mixed Integer Programming
Pierre Le Bodic, George L. Nemhauser
The selection of branching variables is a key component of branch-and-bound algorithms for solving Mixed-Integer Programming (MIP) problems since the quality of the selection proce…
Solving MIPs via Scaling-based Augmentation
Pierre Le Bodic, Jeffrey W. Pavelka, Marc E. Pfetsch +1
Augmentation methods for mixed-integer (linear) programs are a class of primal solution approaches in which a current iterate is augmented to a better solution or proved optimal. I…