| 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 | 314 | 2016 |
| The SCIP optimization suite 7.0 G Gamrath, D Anderson, K Bestuzheva, WK Chen, L Eifler, M Gasse, ... | 236 | 2020 |
| 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 | 92 | 2022 |
| 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 | 43 | 2012 |
| 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 | 33 | 2017 |
| On a stochastic bilevel programming problem S Kosuch, P Le Bodic, J Leung, A Lisser Networks 59 (1), 107-116, 2012 | 33 | 2012 |
| 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 | 26 | 2009 |
| Computing optimal decision sets with SAT J Yu, A Ignatiev, PJ Stuckey, P Le Bodic Principles and Practice of Constraint Programming: 26th International …, 2020 | 23 | 2020 |
| 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 | 22 | 2020 |
| 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 | 22 | 2018 |
| 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 | 13 | 2019 |
| Estimating the size of search trees by sampling with domain knowledge. G Belov, S Esler, D Fernando, P Le Bodic, GL Nemhauser IJCAI, 473-479, 2017 | 11 | 2017 |
| How important are branching decisions: Fooling MIP solvers P Le Bodic, GL Nemhauser Operations Research Letters 43 (3), 273-278, 2015 | 10 | 2015 |
| 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 | 10 | 2015 |
| 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 | 8 | 2022 |
| 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 | 7 | 2021 |
| 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 | 7 | 2021 |
| Approximation algorithms for the transportation problem with market choice and related models K Aardal, P Le Bodic Operations Research Letters 42 (8), 549-552, 2014 | 6 | 2014 |
| Datasets for the evaluation of substitution-tolerant subgraph isomorphism P Héroux, P Le Bodic, S Adam Graphics Recognition. Current Trends and Challenges: 10th International …, 2014 | 6 | 2014 |
| New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem A Kazemi, P Le Bodic, AT Ernst, M Krishnamoorthy Computers & Operations Research 136, 105505, 2021 | 5 | 2021 |
Peter StuckeyFaculty of Information Technology, Monash UniversityVerified email at monash.edu
