Le Bodic, Pierre

9 publications

AAAI 2025 Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey

ECML-PKDD 2025 Gradient Boosting Versus Mixed Integer Programming for Sparse Additive Modeling Fan Yang, Pierre Le Bodic, Mario Boley

AISTATS 2024 Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles Fan Yang, Pierre Le Bodic, Michael Kamp, Mario Boley

AAAI 2021 F-Aware Conflict Prioritization & Improved Heuristics for Conflict-Based Search Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey, Sven Koenig

JAIR 2021 Learning Optimal Decision Sets and Lists with SAT Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic

IJCAI 2019 Branch-and-Cut-and-Price for Multi-Agent Pathfinding Edward Lam, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey

AAAI 2019 Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel

IJCAI 2017 Estimating the Size of Search Trees by Sampling with Domain Knowledge Gleb Belov, Samuel Esler, Dylan Fernando, Pierre Le Bodic, George L. Nemhauser

AAAI 2016 Learning to Branch in Mixed Integer Programming Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, Bistra Dilkina