6 citations · 18 across the 10 of their papers we have counts for
12 papers
Dynamic Menu-Based Pricing for Electric Vehicle Charging with Vehicle-to-Grid Integration
Mozhdeh Hematiboroujeni, Pierre Le Bodic, Adel N. Toosi +1
The number of electric vehicles is rapidly increasing worldwide. This growth brings significant environmental benefits but also introduces new challenges: uncoordinated charging ca…
Optimal Unlabeled Pebble Motion on Trees and its Application to Multi-Agent Path Finding
Annalisa Calvi, Pierre Le Bodic, Samuel McGuire +1
Given a tree, a set of pebbles initially stationed at some nodes of the tree, and a set of target nodes, the Unlabeled Pebble Motion on Trees problem (UPMT) asks to find a plan to…
Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery
Yue Zhang, Zhe Chen, Daniel Harabor +2
We study the problem of online Multi-Agent Pickup and Delivery (MAPD), where a team of agents must repeatedly serve dynamically appearing tasks on a shared map. Existing online met…
Interpretable Representation Learning for 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…
Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles
Fan Yang, Pierre Le Bodic, Michael Kamp +1
Gradient boosting of prediction rules is an efficient approach to learn potentially interpretable yet accurate probabilistic models. However, actual interpretability requires to li…
Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model
Gioni Mexi, Somayeh Shamsi, Mathieu Besançon +1
Strong Branching (SB) is a cornerstone of all modern branching rules used in the Branch-and-Bound (BnB) algorithm, which is at the center of Mixed-Integer Programming solvers. In i…