Pierre Le Bodic

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 41

Top Topics

Integer Program

Valid Inequalities

Network Flow Problem

Top Venues

Publications

Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan
An abstract model for branch and cut. Math. Program. 206 (1) (2024)
Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey
Planning and Execution in Multi-Agent Path Finding: Models and Algorithms. ICAPS (2024)
Fan Yang, Pierre Le Bodic, Michael Kamp, Mario Boley
Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles. AISTATS (2024)
Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey
Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract). SOCS (2024)
Pierre Le Bodic, Edward Lam
Optimal Unlabeled Pebble Motion on Trees. SOCS (2024)
Fan Yang, Pierre Le Bodic, Michael Kamp, Mario Boley
Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles. CoRR (2024)
Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic
Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model. CPAIOR (2) (2024)
Mahboubeh Jahantab, Babak Abbasi, Pierre Le Bodic
Farmland allocation in the conversion from conventional to organic farming. Eur. J. Oper. Res. 311 (3) (2023)
Yue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey
Efficient Multi Agent Path Finding with Turn Actions. SOCS (2023)
Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan
An Abstract Model for Branch-and-Cut. IPCO (2022)
Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version). CoRR (2022)
Edward Lam, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey
Branch-and-cut-and-price for multi-agent path finding. Comput. Oper. Res. 144 (2022)
Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor
Dual Euclidean Shortest Path Search (Extended Abstract). SOCS (2022)
Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch
Estimating the Size of Branch-and-Bound Trees. INFORMS J. Comput. 34 (2) (2022)
Daniel Anderson, Pierre Le Bodic, Kerri Morgan
Further results on an abstract model for branching and its application to mixed integer programming. Math. Program. 190 (1) (2021)
Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig
Further Improved Heuristics For Conflict-Based Search. SOCS (2021)
Ilankaikone Senthooran, Pierre Le Bodic, Peter J. Stuckey
Optimising Training for Service Delivery. CP (2021)
Ahmad Kazemi, Pierre Le Bodic, Andreas T. Ernst, Mohan Krishnamoorthy
New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem. Comput. Oper. Res. 136 (2021)
Mario Boley, Simon Teshuva, Pierre Le Bodic, Geoffrey I. Webb
Better Short than Greedy: Interpretable Models through Optimal Rule Boosting. SDM (2021)
Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic
Learning Optimal Decision Sets and Lists with SAT. J. Artif. Intell. Res. 72 (2021)
Mario Boley, Simon Teshuva, Pierre Le Bodic, Geoffrey I. Webb
Better Short than Greedy: Interpretable Models through Optimal Rule Boosting. CoRR (2021)
Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic
Multi-Target Search in Euclidean Space with Ray Shooting. SOCS (2021)
Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey, Sven Koenig
f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search. AAAI (2021)
Ahmad Kazemi, Pierre Le Bodic, Andreas T. Ernst, Mohan Krishnamoorthy
New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem. CoRR (2021)
Ahmad Kazemi, Andreas T. Ernst, Mohan Krishnamoorthy, Pierre Le Bodic
Locomotive fuel management with inline refueling. Eur. J. Oper. Res. 293 (3) (2021)
Jinqiang Yu, Alexey Ignatiev, Pierre Le Bodic, Peter J. Stuckey
Optimal Decision Lists using SAT. CoRR (2020)
Edward Lam, Pierre Le Bodic
New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. ICAPS (2020)
Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic
Computing Optimal Decision Sets with SAT. CoRR (2020)
Ryan Hechenberger, Peter J. Stuckey, Daniel Harabor, Pierre Le Bodic, Muhammad Aamir Cheema
Online Computation of Euclidean Shortest Paths in Two Dimensions. ICAPS (2020)
Cédric Bentz, Pierre Le Bodic
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth. Theor. Comput. Sci. 809 (2020)
Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner
F-Cardinal Conflicts in Conflict-Based Search. SOCS (2020)
Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic
Computing Optimal Decision Sets with SAT. CP (2020)
Edward Lam, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey
Branch-and-Cut-and-Price for Multi-Agent Pathfinding. IJCAI (2019)
Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation. AAAI (2019)
Pierre Le Bodic, Jeffrey William Pavelka, Marc E. Pfetsch, Sebastian Pokutta
Solving MIPs via scaling-based augmentation. Discret. Optim. 27 (2018)
David Cheng Zarate, Pierre Le Bodic, Tim Dwyer, Graeme Gange, Peter J. Stuckey
Optimal Sankey Diagrams Via Integer Programming. PacificVis (2018)
Gleb Belov, Samuel Esler, Dylan Fernando, Pierre Le Bodic, George L. Nemhauser
Estimating the size of search trees by sampling with domain knowledge. IJCAI (2017)
Pierre Le Bodic, George L. Nemhauser
Erratum to: An abstract model for branching and its application to mixed integer programming. Math. Program. 166 (1-2) (2017)
Pierre Le Bodic, George L. Nemhauser
An abstract model for branching and its application to mixed integer programming. Math. Program. 166 (1-2) (2017)
Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, Bistra Dilkina
Learning to Branch in Mixed Integer Programming. AAAI (2016)
Cédric Bentz, Pierre Le Bodic
A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem. CoRR (2016)
Pierre Le Bodic, George L. Nemhauser
An Abstract Model for Branching and its Application to Mixed Integer Programming. CoRR (2015)
Julien Lerouge, Pierre Le Bodic, Pierre Héroux, Sébastien Adam
GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism. GbRPR (2015)
Pierre Le Bodic, George L. Nemhauser
How important are branching decisions: Fooling MIP solvers. Oper. Res. Lett. 43 (3) (2015)
Karen Aardal, Pierre Le Bodic
Approximation algorithms for the Transportation Problem with Market Choice and related models. CoRR (2014)
Karen Aardal, Pierre Le Bodic
Approximation algorithms for the transportation problem with market choice and related models. Oper. Res. Lett. 42 (8) (2014)
Pierre Héroux, Pierre Le Bodic, Sébastien Adam
Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism. GREC (2013)
Pierre Le Bodic, Pierre Héroux, Sébastien Adam, Yves Lecourtier
An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings. Pattern Recognit. 45 (12) (2012)
Stefanie Kosuch, Pierre Le Bodic, Janny Leung, Abdel Lisser
On a stochastic bilevel programming problem. Networks 59 (1) (2012)
Pierre Le Bodic, Hervé Locteau, Sébastien Adam, Pierre Héroux, Yves Lecourtier, Arnaud Knippel
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming. ICDAR (2009)