Projects per year
Personal profile
Biography
I am a senior lecturer in the faculty of IT at Monash University. I am primarily interested in solving general and applied Discrete Optimisation problems. I was previously a postdoc in Industrial and Systems Engineering at Georgia Institute of Technology, and I obtained my PhD in CS from Université Paris 11.
Education/Academic qualification
Information Technology, Doctor of Philosophy, Universite of Paris-Sud (Paris-Sud University)
Award Date: 28 Sept 2012
Research area keywords
- Combinatorial Optimisation
- Approximation
- Complexity
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Improved Constraint Reasoning for Robust Multi-agent Path Planning
Stuckey, P., Harabor, D., Le Bodic, P., Gange, G. & Koenig, S.
1/01/20 → 31/12/23
Project: Research
-
Agilent Thought Leader Project Extension
Marriott, K., Bonnington, P., Tack, G. & Le Bodic, P.
1/10/21 → 1/09/22
Project: Research
-
Health or economy? Making the best impossible decision.
Le Bodic, P., Ernst, A., Thamrin, S. A. & Nasir, S.
27/08/20 → 27/11/20
Project: Research
-
Data61 CRP - "Optimisation technologies and datasets for energy systems"
Liebman, A., Tack, G., Wallace, M., Le Bodic, P., Dunstall, S., LANGRENÉ, N. & Schutt, A.
1/07/19 → 30/06/20
Project: Research
-
Agilent Thought Leader Award
Bonnington, P., Marriott, K., Le Bodic, P. & Tack, G.
11/02/19 → 11/02/22
Project: Research
-
An abstract model for branch-and-cut
Kazachkov, A. M., Le Bodic, P. & Sankaranarayanan, S., 2022, Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022 Eindhoven, The Netherlands, June 27–29, 2022 Proceedings. Aardal, K. & Sanità, L. (eds.). Cham Switzerland: Springer, p. 333-346 14 p. (Lecture Notes in Computer Science; vol. 13265).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review
1 Citation (Scopus) -
Branch-and-cut-and-price for Multi-Agent Path Finding
Lam, E., Le Bodic, P., Harabor, D. & Stuckey, P. J., Aug 2022, In: Computers and Operations Research. 144, 13 p., 105809.Research output: Contribution to journal › Article › Research › peer-review
9 Citations (Scopus) -
Estimating the size of branch-and-bound trees
Hendel, G., Anderson, D., Le Bodic, P. & Pfetsch, M. E., Mar 2022, In: INFORMS Journal on Computing. 34, 2, p. 934-952 19 p.Research output: Contribution to journal › Article › Research › peer-review
5 Citations (Scopus) -
Better short than greedy: interpretable models through optimal rule boosting
Boley, M., Teshuva, S., Le Bodic, P. & Webb, G., 2021, Proceedings of the 2021 SIAM International Conference on Data Mining (SDM). Demeniconi, C. & Davidson, I. (eds.). Philadephia PA USA: Society for Industrial & Applied Mathematics (SIAM), p. 351-359 9 p.Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review
Open AccessFile -
F-Aware conflict prioritization & improved heuristics for Conflict-Based Search
Boyarski, E., Felner, A., Le Bodic, P., Harabor, D., Stuckey, P. J. & Koenig, S., 2021, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI-21. Leyton-Brown, K. & M. (eds.). Palo Alto CA USA: Association for the Advancement of Artificial Intelligence (AAAI), p. 12241-12248 8 p. (35th AAAI Conference on Artificial Intelligence, AAAI 2021; vol. 35, no. 14).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review
Open AccessFile3 Citations (Scopus)