Pierre Le Bodic

According to our database, Pierre Le Bodic authored at least 44 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

An abstract model for branch and cut.

Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan

Math. Program., July, 2024

Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract).

Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Optimal Unlabeled Pebble Motion on Trees.

Pierre Le Bodic, Edward Lam

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Planning and Execution in Multi-Agent Path Finding: Models and Algorithms.

Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey

Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model.

Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024

Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles.

Fan Yang, Pierre Le Bodic, Michael Kamp, Mario Boley

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Farmland allocation in the conversion from conventional to organic farming.

Mahboubeh Jahantab, Babak Abbasi, Pierre Le Bodic

Eur. J. Oper. Res., December, 2023

Efficient Multi Agent Path Finding with Turn Actions.

Yue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

2022

Estimating the Size of Branch-and-Bound Trees.

Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch

INFORMS J. Comput., 2022

Multi-Target Search in Euclidean Space with Ray Shooting (Full Version).

Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic

CoRR, 2022

Branch-and-cut-and-price for multi-agent path finding.

Edward Lam, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey

Comput. Oper. Res., 2022

Dual Euclidean Shortest Path Search (Extended Abstract).

Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

2021

Further results on an abstract model for branching and its application to mixed integer programming.

Daniel Anderson, Pierre Le Bodic, Kerri Morgan

Math. Program., 2021

Learning Optimal Decision Sets and Lists with SAT.

Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic

J. Artif. Intell. Res., 2021

Locomotive fuel management with inline refueling.

Ahmad Kazemi, Andreas T. Ernst, Mohan Krishnamoorthy, Pierre Le Bodic

Eur. J. Oper. Res., 2021

New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem.

Ahmad Kazemi, Pierre Le Bodic, Andreas T. Ernst, Mohan Krishnamoorthy

CoRR, 2021

New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem.

Ahmad Kazemi, Pierre Le Bodic, Andreas T. Ernst, Mohan Krishnamoorthy

Comput. Oper. Res., 2021

Multi-Target Search in Euclidean Space with Ray Shooting.

Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Further Improved Heuristics For Conflict-Based Search.

Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Better Short than Greedy: Interpretable Models through Optimal Rule Boosting.

Mario Boley, Simon Teshuva, Pierre Le Bodic, Geoffrey I. Webb

Proceedings of the 2021 SIAM International Conference on Data Mining, 2021

Optimising Training for Service Delivery.

Ilankaikone Senthooran, Pierre Le Bodic, Peter J. Stuckey

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search.

Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey, Sven Koenig

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth.

Cédric Bentz, Pierre Le Bodic

Theor. Comput. Sci., 2020

Optimal Decision Lists using SAT.

Jinqiang Yu, Alexey Ignatiev, Pierre Le Bodic, Peter J. Stuckey

CoRR, 2020

F-Cardinal Conflicts in Conflict-Based Search.

Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Computing Optimal Decision Sets with SAT.

Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic

Proceedings of the Principles and Practice of Constraint Programming, 2020

New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding.

Edward Lam, Pierre Le Bodic

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Online Computation of Euclidean Shortest Paths in Two Dimensions.

Ryan Hechenberger, Peter J. Stuckey, Daniel Harabor, Pierre Le Bodic, Muhammad Aamir Cheema

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019

Branch-and-Cut-and-Price for Multi-Agent Pathfinding.

Edward Lam, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation.

Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Solving MIPs via scaling-based augmentation.

Pierre Le Bodic, Jeffrey William Pavelka, Marc E. Pfetsch, Sebastian Pokutta

Discret. Optim., 2018

Optimal Sankey Diagrams Via Integer Programming.

David Cheng Zarate, Pierre Le Bodic, Tim Dwyer, Graeme Gange, Peter J. Stuckey

Proceedings of the IEEE Pacific Visualization Symposium, 2018

2017

Erratum to: An abstract model for branching and its application to mixed integer programming.

Pierre Le Bodic, George L. Nemhauser

Math. Program., 2017

An abstract model for branching and its application to mixed integer programming.

Pierre Le Bodic, George L. Nemhauser

Math. Program., 2017

Estimating the size of search trees by sampling with domain knowledge.

Gleb Belov, Samuel Esler, Dylan Fernando, Pierre Le Bodic, George L. Nemhauser

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem.

Cédric Bentz, Pierre Le Bodic

CoRR, 2016

Learning to Branch in Mixed Integer Programming.

Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, Bistra Dilkina

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

How important are branching decisions: Fooling MIP solvers.

Pierre Le Bodic, George L. Nemhauser

Oper. Res. Lett., 2015

GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism.

Julien Lerouge, Pierre Le Bodic, Pierre Héroux, Sébastien Adam

Proceedings of the Graph-Based Representations in Pattern Recognition, 2015

2014

Approximation algorithms for the transportation problem with market choice and related models.

Karen I. Aardal, Pierre Le Bodic

Oper. Res. Lett., 2014

2013

Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism.

Pierre Héroux, Pierre Le Bodic, Sébastien Adam

Proceedings of the Graphics Recognition. Current Trends and Challenges, 2013

2012

An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings.

Pierre Le Bodic, Pierre Héroux, Sébastien Adam, Yves Lecourtier

Pattern Recognit., 2012

On a stochastic bilevel programming problem.

Stefanie Kosuch, Pierre Le Bodic, Janny Leung, Abdel Lisser

Networks, 2012

2009

Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming.

Pierre Le Bodic, Hervé Locteau, Sébastien Adam, Pierre Héroux, Yves Lecourtier, Arnaud Knippel

Proceedings of the 10th International Conference on Document Analysis and Recognition, 2009