Pierre Le Bodic

Geciteerd door

	Alles	Sinds 2019
Citaties	1234	1096
h-index	12	12
i10-index	19	18

320

160

240

2010201120122013201420152016201720182019202020212022202320244 6 10 12 9 14 23 27 27 59 115 264 268 307 82

Openbare toegang

Alles bekijken

14 artikelen

0 artikelen

beschikbaar

niet beschikbaar

Op basis van financieringsmachtigingen

Medeauteurs

Peter StuckeyFaculty of Information Technology, Monash UniversityGeverifieerd e-mailadres voor monash.edu
Daniel HaraborMonash UniversityGeverifieerd e-mailadres voor monash.edu
George NemhauserProfessor, Georgia Institute of TechnologyGeverifieerd e-mailadres voor isye.gatech.edu
Pierre HérouxAssistant Professor, LITIS - University of Rouen, FranceGeverifieerd e-mailadres voor litislab.eu
Sébastien AdamProfessor, LITIS, University of RouenGeverifieerd e-mailadres voor univ-rouen.fr
Edward LamMonash UniversityGeverifieerd e-mailadres voor monash.edu
Le SongBiomap, Mohamed bin Zayed University of Artificial IntelligenceGeverifieerd e-mailadres voor biomap.com
Bistra DilkinaAssoc. Professor of Computer Science and co-Director of the Center for AI in Society, USCGeverifieerd e-mailadres voor usc.edu
Elias B. KhalilAssistant Professor, University of TorontoGeverifieerd e-mailadres voor mie.utoronto.ca
Daniel AndersonAssistant Teaching Professor, Carnegie Mellon UniversityGeverifieerd e-mailadres voor cs.cmu.edu
Janny LeungThe University of MacauGeverifieerd e-mailadres voor se.cuhk.edu.hk
Eli BoyarskiBen-Gurion University of the NegevGeverifieerd e-mailadres voor post.bgu.ac.il
Ariel FelnerBen-Gurion UniversityGeverifieerd e-mailadres voor bgu.ac.il
Tim DwyerMonash UniversityGeverifieerd e-mailadres voor monash.edu
Karen AardalGeverifieerd e-mailadres voor tudelft.nl
Julien LerougeSenior Data Scientist, QuickSignGeverifieerd e-mailadres voor lerouge.me

Volgen

Pierre Le Bodic

Senior Lecturer in the faculty of IT, Monash University

Geverifieerd e-mailadres voor monash.edu

Mixed Integer Programming Complexity algorithms and approximation


Titel Sorteren op citaties Sorteren op jaar Sorteren op titel	Geciteerd door Geciteerd door	Jaar
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	408	2016
The SCIP optimization suite 7.0 G Gamrath, D Anderson, K Bestuzheva, WK Chen, L Eifler, M Gasse, ...	292	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	118	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	48	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	37	2017
On a stochastic bilevel programming problem S Kosuch, P Le Bodic, J Leung, A Lisser Networks 59 (1), 107-116, 2012	33	2012
Computing optimal decision sets with SAT J Yu, A Ignatiev, PJ Stuckey, P Le Bodic Principles and Practice of Constraint Programming: 26th International …, 2020	32	2020
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	29	2009
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	27	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	27	2018
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	17	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	15	2019
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	12	2021
Optimal decision lists using SAT J Yu, A Ignatiev, PL Bodic, PJ Stuckey arXiv preprint arXiv:2010.09919, 2020	12	2020
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	12	2017
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	10	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	10	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	10	2020
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	8	2015

Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.

Artikelen 1–20

Citaties per jaar

Dubbele citaties

Samengevoegde citaties

Medeauteurs toevoegenMedeauteurs

Volgen

Geciteerd door

Medeauteurs