| 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 | 245 | 2016 |
| The SCIP optimization suite 7.0 G Gamrath, D Anderson, K Bestuzheva, WK Chen, L Eifler, M Gasse, ... | 185 | 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 | 64 | 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 | 44 | 2012 |
| On a stochastic bilevel programming problem S Kosuch, P Le Bodic, J Leung, A Lisser Networks 59 (1), 107-116, 2012 | 33 | 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 | 29 | 2017 |
| 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 |
| 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 | 20 | 2018 |
| Computing optimal decision sets with SAT J Yu, A Ignatiev, PJ Stuckey, P Le Bodic International Conference on Principles and Practice of Constraint …, 2020 | 18 | 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 | 16 | 2020 |
| 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 | 12 | 2019 |
| GEM++: a tool for solving substitution-tolerant subgraph isomorphism J Lerouge, PL Bodic, P Héroux, S Adam International Workshop on Graph-Based Representations in Pattern Recognition …, 2015 | 11 | 2015 |
| 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 | 10 | 2017 |
| How important are branching decisions: fooling MIP solvers P Le Bodic, GL Nemhauser Operations Research Letters 43 (3), 273-278, 2015 | 10 | 2015 |
| 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, PL Bodic, S Adam International Workshop on Graphics Recognition, 240-251, 2013 | 6 | 2013 |
| 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 | 5 | 2022 |
| 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 | 5 | 2020 |
| Solving MIPs via scaling-based augmentation P Le Bodic, JW Pavelka, ME Pfetsch, S Pokutta Discrete Optimization 27, 1-25, 2018 | 5 | 2018 |
| F-cardinal conflicts in conflict-based search E Boyarski, D Harabor, P Stuckey, P Le Bodic, A Felner International Symposium on Combinatorial Search 11 (1), 2020 | 4 | 2020 |
Peter StuckeyFaculty of Information Technology, Monash UniversityVerified email at monash.edu
