4 citations · 5 across the 3 of their papers we have counts for
3 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…