Folgen
Pierre Le Bodic
Pierre Le Bodic
Senior Lecturer in the faculty of IT, Monash University
Bestätigte E-Mail-Adresse bei monash.edu
Titel
Zitiert von
Zitiert von
Jahr
Learning to branch in mixed integer programming
E Khalil, P Le Bodic, L Song, G Nemhauser, B Dilkina
Proceedings of the AAAI conference on artificial intelligence 30 (1), 2016
4362016
The SCIP optimization suite 7.0
G Gamrath, D Anderson, K Bestuzheva, WK Chen, L Eifler, M Gasse, ...
2992020
Branch-and-cut-and-price for multi-agent path finding
E Lam, P Le Bodic, D Harabor, PJ Stuckey
Computers & Operations Research 144, 105809, 2022
1352022
An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings
P Le Bodic, P Héroux, S Adam, Y Lecourtier
Pattern Recognition 45 (12), 4214-4224, 2012
462012
An Abstract Model for Branching and its Application to Mixed Integer Programming
P Le Bodic, GL Nemhauser
Mathematical Programming 165 (1-2), 369-405, 2017
372017
Computing optimal decision sets with SAT
J Yu, A Ignatiev, PJ Stuckey, P Le Bodic
Principles and Practice of Constraint Programming: 26th International …, 2020
332020
On a stochastic bilevel programming problem
S Kosuch, P Le Bodic, J Leung, A Lisser
Networks 59 (1), 107-116, 2012
332012
New valid inequalities in branch-and-cut-and-price for multi-agent path finding
E Lam, P Le Bodic
Proceedings of the International Conference on Automated Planning and …, 2020
292020
Optimal sankey diagrams via integer programming
DC Zarate, P Le Bodic, T Dwyer, G Gange, P Stuckey
2018 IEEE pacific visualization symposium (PacificVis), 135-139, 2018
292018
Symbol detection using region adjacency graphs and integer linear programming
P Le Bodic, H Locteau, S Adam, P Héroux, Y Lecourtier, A Knippel
2009 10th International Conference on Document Analysis and Recognition …, 2009
282009
Learning optimal decision sets and lists with sat
J Yu, A Ignatiev, PJ Stuckey, P Le Bodic
Journal of Artificial Intelligence Research 72, 1251-1279, 2021
192021
Estimating the size of branch-and-bound trees
G Hendel, D Anderson, P Le Bodic, ME Pfetsch
INFORMS Journal on Computing 34 (2), 934-952, 2022
172022
Clairvoyant restarts in branch-and-bound search using online tree-size estimation
D Anderson, G Hendel, P Le Bodic, M Viernickel
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1427-1434, 2019
152019
F-aware conflict prioritization & improved heuristics for conflict-based search
E Boyarski, A Felner, P Le Bodic, DD Harabor, PJ Stuckey, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12241 …, 2021
132021
Optimal decision lists using SAT
J Yu, A Ignatiev, PL Bodic, PJ Stuckey
arXiv preprint arXiv:2010.09919, 2020
132020
Online computation of euclidean shortest paths in two dimensions
R Hechenberger, PJ Stuckey, D Harabor, P Le Bodic, MA Cheema
Proceedings of the International Conference on Automated Planning and …, 2020
122020
Estimating the size of search trees by sampling with domain knowledge
G Belov, S Esler, D Fernando, P Le Bodic, GL Nemhauser
International Joint Conference on Artificial Intelligence 2017, 473-479, 2017
122017
Better short than greedy: Interpretable models through optimal rule boosting
M Boley, S Teshuva, PL Bodic, GI Webb
Proceedings of the 2021 SIAM international conference on data mining (SDM …, 2021
102021
How important are branching decisions: Fooling MIP solvers
P Le Bodic, GL Nemhauser
Operations Research Letters 43 (3), 273-278, 2015
102015
Gem++: A tool for solving substitution-tolerant subgraph isomorphism
J Lerouge, P Le Bodic, P Héroux, S Adam
Graph-Based Representations in Pattern Recognition: 10th IAPR-TC-15 …, 2015
82015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20