Pierre Le Bodic

Australian Regenerative Medicine Institute — Australia

Computer Science · Physical Sciences

12h-index740citations73works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Robotic Path Planning Algorithms(15), Vehicle Routing Optimization Methods(12), Complexity and Algorithms in Graphs(8), Constraint Satisfaction and Optimization(7), Machine Learning and Data Classification(7)

Publications73 total

Gradient Boosting Versus Mixed Integer Programming for Sparse Additive Modeling
Lecture notes in computer science·2025
Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery
arXiv (Cornell University)·2025Open Access
Interpretable Representation Learning for Additive Rule Ensembles
arXiv (Cornell University)·2025Open Access
Needles in the Haystack-Rapid Error Detection for Cell Tracking Solutions
2025
Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities
Proceedings of the AAAI Conference on Artificial Intelligence·2025Open Access
A Simplified Model for Marker-Assisted Gene Pyramiding: Minimising Generations and Crossings
SSRN Electronic Journal·2025Open Access
Degradation-Aware Charger Deployment, Battery Sizing, and Charge Scheduling for Electric Bus Fleets
IEEE Transactions on Transportation Electrification·2025
Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract)
Proceedings of the International Symposium on Combinatorial Search·2024Open Access
Optimal Unlabeled Pebble Motion on Trees
Proceedings of the International Symposium on Combinatorial Search·2024· 1 citedOpen Access
Planning and Execution in Multi-Agent Path Finding: Models and Algorithms
Proceedings of the International Conference on Automated Planning and Scheduling·2024· 4 citedOpen Access
Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles
arXiv (Cornell University)·2024· 1 citedOpen Access
Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model
Lecture notes in computer science·2024Open Access
Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model
arXiv (Cornell University)·2023Open Access
A simplified model for plant breeding
2023Open Access
Efficient Multi Agent Path Finding with Turn Actions
Proceedings of the International Symposium on Combinatorial Search·2023· 3 citedOpen Access
An abstract model for branch and cut
Mathematical Programming·2023· 3 cited
Farmland allocation in the conversion from conventional to organic farming
European Journal of Operational Research·2023· 16 citedOpen Access
Kesehatan atau ekonomi dulu? Mencari keputusan terbaik dalam menghadapi pandemi
2022
Health or economy? Making the best impossible decision in the face of COVID-19
2022
Dual Euclidean Shortest Path Search (Extended Abstract)
Proceedings of the International Symposium on Combinatorial Search·2022· 1 citedOpen Access
page 1 of 4Next →

Frequent Co-authors

Peter J. Stuckey(15), Daniel Harabor(11), Pierre Héroux(6), Sébastien Adam(6), George L. Nemhauser(5), Edward Lam(4), Jinqiang Yu(4), Alexey Ignatiev(4), Andreas Ernst(4), Ryan Hechenberger(4), Y. Lecourtier(3), Ahmad Kazemi(3), Mohan Krishnamoorthy(3), Muhammad Aamir Cheema(3), Mario Boley(3), Eli Boyarski(3), Ariel Felner(3), Cédric Bentz(3), Hervé Locteau(2), Gregor Hendel(2)