Pierre Le Bodic

Citée par

	Toutes	Depuis 2020
Citations	1469	1263
indice h	14	13
indice i10	20	15

300

150

225

20102011201220132014201520162017201820192020202120222023202420254 6 10 12 9 14 24 26 28 64 121 270 269 291 266 42

Accès public

Tout afficher

15 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Peter StuckeyFaculty of Information Technology, Monash UniversityAdresse e-mail validée de monash.edu
Daniel HaraborMonash UniversityAdresse e-mail validée de monash.edu
George NemhauserProfessor, Georgia Institute of TechnologyAdresse e-mail validée de isye.gatech.edu
Edward LamMonash UniversityAdresse e-mail validée de monash.edu
Pierre HérouxAssistant Professor, LITIS - University of Rouen, FranceAdresse e-mail validée de litislab.eu
Sébastien AdamProfessor, LITIS, University of RouenAdresse e-mail validée de univ-rouen.fr
Le SongGenBio AI, Mohamed bin Zayed University of Artificial IntelligenceAdresse e-mail validée de mbzuai.ac.ae
Bistra DilkinaAssoc. Professor of Computer Science and co-Director of the Center for AI in Society, USCAdresse e-mail validée de usc.edu
Elias B. KhalilAssistant Professor, University of TorontoAdresse e-mail validée de mie.utoronto.ca
Daniel AndersonAssistant Teaching Professor, Carnegie Mellon UniversityAdresse e-mail validée de cs.cmu.edu
Janny LeungThe University of MacauAdresse e-mail validée de se.cuhk.edu.hk
Eli BoyarskiBen-Gurion University of the NegevAdresse e-mail validée de post.bgu.ac.il
Ariel FelnerBen-Gurion UniversityAdresse e-mail validée de bgu.ac.il
Tim DwyerMonash UniversityAdresse e-mail validée de monash.edu
Julien LerougeSenior Data Scientist, QuickSignAdresse e-mail validée de lerouge.me
Karen AardalAdresse e-mail validée de tudelft.nl

Suivre

Pierre Le Bodic

Senior Lecturer in the faculty of IT, Monash University

Adresse e-mail validée de monash.edu

Mixed Integer Programming Complexity algorithms and approximation


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	505	2016
The SCIP optimization suite 7.0 G Gamrath, D Anderson, K Bestuzheva, WK Chen, L Eifler, M Gasse, ...	308	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	163	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	47	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	42	2017
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	35	2020
Computing optimal decision sets with SAT J Yu, A Ignatiev, PJ Stuckey, P Le Bodic Principles and Practice of Constraint Programming: 26th International …, 2020	34	2020
On a stochastic bilevel programming problem S Kosuch, P Le Bodic, J Leung, A Lisser Networks 59 (1), 107-116, 2012	34	2012
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	33	2018
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	28	2009
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	25	2021
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	22	2022
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	17	2019
Optimal decision lists using SAT J Yu, A Ignatiev, PL Bodic, PJ Stuckey arXiv preprint arXiv:2010.09919, 2020	14	2020
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	13	2021
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	13	2020
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	13	2017
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	11	2021
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

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs