4 citations · 10 across the 6 of their papers we have counts for
6 papers
Sparse Oblique Rule Boosting for Simpler Additive Rule Ensembles
Shahrzad Behzadimanesh, Pierre Le Bodic, Geoffrey I. Webb +1
Small additive ensembles of symbolic rules offer interpretable prediction models. Traditionally, these ensembles use rule conditions based on conjunctions of simple threshold propo…
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…
A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem
Cédric Bentz, Pierre Le Bodic
Pruhs and Woeginger prove the existence of FPTAS's for a general class of minimization and maximization subset selection problems. Without losing generality from the original frame…
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…
Approximation algorithms for the Transportation Problem with Market Choice and related models
Karen Aardal, Pierre Le Bodic
Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the cli…