Pierre Le Bodic
Pierre Le Bodic
Lecturer in the faculty of IT, Monash University
Verified email at monash.edu
Title
Cited by
Cited by
Year
Learning to branch in mixed integer programming
EB Khalil, P Le Bodic, L Song, G Nemhauser, B Dilkina
Thirtieth AAAI Conference on Artificial Intelligence, 2016
1082016
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
322012
On a stochastic bilevel programming problem
S Kosuch, P Le Bodic, J Leung, A Lisser
Networks 59 (1), 107-116, 2012
262012
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
222009
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
192017
Branch-and-Cut-and-Price for Multi-Agent Pathfinding.
E Lam, P Le Bodic, DD Harabor, PJ Stuckey
IJCAI, 1289-1296, 2019
152019
Gem++: A tool for solving substitution-tolerant subgraph isomorphism
J Lerouge, P Le Bodic, P Héroux, S Adam
International Workshop on Graph-Based Representations in Pattern Recognition …, 2015
82015
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
72018
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
72014
The SCIP Optimization Suite 7.0
G Gamrath, D Anderson, K Bestuzheva, WK Chen, L Eifler, M Gasse, ...
62020
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, 1427-1434, 2019
62019
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
62017
How important are branching decisions: fooling MIP solvers
P Le Bodic, GL Nemhauser
Operations Research Letters 43 (3), 273-278, 2015
62015
Datasets for the evaluation of substitution-tolerant subgraph isomorphism
P Héroux, P Le Bodic, S Adam
International Workshop on Graphics Recognition, 240-251, 2013
42013
On a stochastic bilevel programming problem with knapsack constraints
S Kosuch, P Le Bodic, J Leung, A Lisser
Proceedings of the International Network Optimization Conference, 2009
42009
Solving MIPs via scaling-based augmentation
P Le Bodic, JW Pavelka, ME Pfetsch, S Pokutta
Discrete Optimization 27, 1-25, 2018
32018
Variantes non standards de problèmes d'optimisation combinatoire
P Le Bodic
Paris 11, 2012
32012
Computing Optimal Decision Sets with SAT
J Yu, A Ignatiev, PJ Stuckey, P Le Bodic
International Conference on Principles and Practice of Constraint …, 2020
12020
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
12020
Formulations linéaires en nombres entiers pour des problèmes d'isomorphisme exact et inexact
P Le Bodic, S Adam, P Héroux, A Knippel, Y Lecourtier
12008
The system can't perform the operation now. Try again later.
Articles 1–20