4 citations · 10 across the 6 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.OC2015★ 2 cited
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…
math.OC2015
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…