Pierre Le Bodic
Pierre Le Bodic
Lecturer in the faculty of IT, Monash University
Email verificata su monash.edu
TitoloCitata daAnno
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
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
On a stochastic bilevel programming problem
S Kosuch, P Le Bodic, J Leung, A Lisser
Networks 59 (1), 107-116, 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
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
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
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
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
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
How important are branching decisions: fooling MIP solvers
P Le Bodic, GL Nemhauser
Operations Research Letters 43 (3), 273-278, 2015
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
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
Variantes non standards de problèmes d'optimisation combinatoire
P Le Bodic
Paris 11, 2012
Branch-and-cut-and-price for multi-agent pathfinding
E Lam, P Le Bodic, D Harabor, PJ Stuckey
Proceedings of the Twenty-Eighth International Joint Conference on …, 2019
Solving MIPs via scaling-based augmentation
P Le Bodic, JW Pavelka, ME Pfetsch, S Pokutta
Discrete Optimization 27, 1-25, 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, 1427-1434, 2019
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
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
C Bentz, P Le Bodic
Theoretical Computer Science 809, 239-249, 2020
Erratum to: An abstract model for branching and its application to mixed integer programming
P Le Bodic, G Nemhauser
Mathematical Programming 166 (1-2), 407-407, 2017
Programmation linéaire en nombres entiers pour la recherche d'isomorphisme de sous-graphe: Application à la recherche de symboles graphiques
P Le Bodic, P Héroux, S Adam, H Locteau, JNB Mboumba, Y Lecourtier
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20