Pierre Le Bodic

Lecturer, Department of Data Science & AI

EmailPierre.LeBodic@monash.edu

Research output per year

If you made any changes in Pure these will be visible here soon.

Personal profile

Biography

I am a lecturer in the faculty of IT at Monash University. 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.
I am primarily interested in Discrete Optimisation and Computational Complexity.

Education/Academic qualification

Information Technology, Doctor of Philosophy, Universite of Paris-Sud (Paris-Sud University)

Award Date: 28 Sep 2012

Research area keywords

Combinatorial Optimisation
Approximation
Complexity

Network

Recent external collaboration on country level. Dive into details by clicking on the dots.

2 Finished
2 Active

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/22
Project: Research
Agilent Thought Leader Award
Bonnington, P., Marriott, K., Le Bodic, P. & Tack, G.
11/02/19 → 11/02/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., LANGRENÉ, N. & Schutt, A. S.
1/07/19 → 30/06/20
Project: Research

10 Conference Paper
8 Article
1 Chapter (Book)
1 Comment / Debate

Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
Bentz, C. & Le Bodic, P., 24 Feb 2020, In : Theoretical Computer Science. 809, p. 239-249 11 p.
Research output: Contribution to journal › Article › Research › peer-review
Computing optimal decision sets with SAT
Yu, J., Ignatiev, A., Stuckey, P. J. & Le Bodic, P., 2020, Principles and Practice of Constraint Programming: 26th International Conference, CP 2020 Louvain-la-Neuve, Belgium, September 7–11, 2020 Proceedings. Simonis, H. (ed.). Cham Switzerland: Springer, p. 952-970 19 p. (Lecture Notes in Computer Science ; vol. 12333).
Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review
Further results on an abstract model for branching and its application to mixed integer programming
Anderson, D., Le Bodic, P. & Morgan, K., 27 Aug 2020, (Accepted/In press) In : Mathematical Programming. 31 p.
Research output: Contribution to journal › Article › Research › peer-review
New valid inequalities in branch-and-cut-and-price for Multi-agent Path Finding
Lam, E. & Le Bodic, P., 1 Jun 2020, Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling. Christopher Beck, J., Buffet, O., Hoffmann, J., Karpas, E. & Sohrabi, S. (eds.). Palo Alto CA USA: Association for the Advancement of Artificial Intelligence (AAAI), p. 184-192 9 p. (Proceedings International Conference on Automated Planning and Scheduling, ICAPS; vol. 30).
Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

Open Access
File
Online computation of Euclidean Shortest Paths in two dimensions
Hechenberger, R., Stuckey, P. J., Harabor, D., Le Bodic, P. & Cheema, M. A., 1 Jun 2020, Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling. Christopher Beck, J., Buffet, O., Hoffmann, J., Karpas, E. & Sohrabi, S. (eds.). Palo Alto CA USA: Association for the Advancement of Artificial Intelligence (AAAI), p. 134-142 9 p. (Proceedings International Conference on Automated Planning and Scheduling, ICAPS; vol. 30).
Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

Open Access
File