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 (ICDAR, 2009)

On a stochastic bilevel programming problem. - Stefanie Kosuch; Pierre Le Bodic; Janny Leung; Abdel Lisser (Networks, 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)

Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism. - Pierre Héroux; Pierre Le Bodic; Sébastien Adam (GREC, 2013)

Approximation algorithms for the transportation problem with market choice and related models. - Karen I. Aardal; Pierre Le Bodic (Oper. Res. Lett., 2014)

GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism. - Julien Lerouge; Pierre Le Bodic; Pierre Héroux; Sébastien Adam (GbRPR, 2015)

How important are branching decisions: Fooling MIP solvers. - Pierre Le Bodic; George L. Nemhauser (Oper. Res. Lett., 2015)

Learning to Branch in Mixed Integer Programming. - Elias Boutros Khalil; Pierre Le Bodic; Le Song; George L. Nemhauser; Bistra Dilkina (AAAI, 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)

Estimating the size of search trees by sampling with domain knowledge. - Gleb Belov; Samuel Esler; Dylan Fernando; Pierre Le Bodic; George L. Nemhauser (IJCAI, 2017)

An abstract model for branching and its application to mixed integer programming. - Pierre Le Bodic; George L. Nemhauser (Math. Program., 2017)

Erratum to: An abstract model for branching and its application to mixed integer programming. - Pierre Le Bodic; George L. Nemhauser (Math. Program., 2017)

Optimal Sankey Diagrams Via Integer Programming. - David Cheng Zarate; Pierre Le Bodic; Tim Dwyer; Graeme Gange; Peter J. Stuckey (PacificVis, 2018)

Solving MIPs via scaling-based augmentation. - Pierre Le Bodic; Jeffrey William Pavelka; Marc E. Pfetsch; Sebastian Pokutta (Discret. Optim., 2018)

Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation. - Daniel Anderson; Gregor Hendel; Pierre Le Bodic; Merlin Viernickel (AAAI, 2019)

Branch-and-Cut-and-Price for Multi-Agent Pathfinding. - Edward Lam 001; Pierre Le Bodic; Daniel Damir Harabor; Peter J. Stuckey (IJCAI, 2019)

Online Computation of Euclidean Shortest Paths in Two Dimensions. - Ryan Hechenberger; Peter J. Stuckey; Daniel Harabor; Pierre Le Bodic; Muhammad Aamir Cheema (ICAPS, 2020)

New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. - Edward Lam 001; Pierre Le Bodic (ICAPS, 2020)

Computing Optimal Decision Sets with SAT. - Jinqiang Yu; Alexey Ignatiev; Peter J. Stuckey; Pierre Le Bodic (CP, 2020)

F-Cardinal Conflicts in Conflict-Based Search. - Eli Boyarski; Daniel Harabor; Peter J. Stuckey; Pierre Le Bodic; Ariel Felner (SOCS, 2020)

Optimal Decision Lists using SAT. - Jinqiang Yu; Alexey Ignatiev; Pierre Le Bodic; Peter J. Stuckey (CoRR, 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)

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 (AAAI, 2021)

Optimising Training for Service Delivery. - Ilankaikone Senthooran; Pierre Le Bodic; Peter J. Stuckey (CP, 2021)

Better Short than Greedy: Interpretable Models through Optimal Rule Boosting. - Mario Boley; Simon Teshuva; Pierre Le Bodic; Geoffrey I. Webb (SDM, 2021)

Further Improved Heuristics For Conflict-Based Search. - Eli Boyarski; Ariel Felner; Pierre Le Bodic; Daniel Harabor; Peter J. Stuckey; Sven Koenig (SOCS, 2021)

Multi-Target Search in Euclidean Space with Ray Shooting. - Ryan Hechenberger; Daniel Harabor; Muhammad Aamir Cheema; Peter J. Stuckey; Pierre Le Bodic (SOCS, 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)

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)

Locomotive fuel management with inline refueling. - Ahmad Kazemi; Andreas T. Ernst; Mohan Krishnamoorthy; Pierre Le Bodic (Eur. J. Oper. Res., 2021)

Learning Optimal Decision Sets and Lists with SAT. - Jinqiang Yu; Alexey Ignatiev; Peter J. Stuckey; Pierre Le Bodic (J. Artif. Intell. Res., 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)

Dual Euclidean Shortest Path Search (Extended Abstract). - Ryan Hechenberger; Peter J. Stuckey; Pierre Le Bodic; Daniel Damir Harabor (SOCS, 2022)

Branch-and-cut-and-price for multi-agent path finding. - Edward Lam 001; Pierre Le Bodic; Daniel Harabor; Peter J. Stuckey (Comput. Oper. Res., 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)

Estimating the Size of Branch-and-Bound Trees. - Gregor Hendel; Daniel Anderson; Pierre Le Bodic; Marc E. Pfetsch (INFORMS J. Comput., 2022)

Efficient Multi Agent Path Finding with Turn Actions. - Yue Zhang 048; Daniel Harabor; Pierre Le Bodic; Peter J. Stuckey (SOCS, 2023)

Farmland allocation in the conversion from conventional to organic farming. - Mahboubeh Jahantab; Babak Abbasi; Pierre Le Bodic (Eur. J. Oper. Res., 2023)

Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles. - Fan Yang; Pierre Le Bodic; Michael Kamp; Mario Boley (AISTATS, 2024)

Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model. - Gioni Mexi; Somayeh Shamsi; Mathieu Besançon; Pierre Le Bodic (CPAIOR (2), 2024)

Planning and Execution in Multi-Agent Path Finding: Models and Algorithms. - Yue Zhang 048; Zhe Chen 016; Daniel Harabor; Pierre Le Bodic; Peter J. Stuckey (ICAPS, 2024)

Optimal Unlabeled Pebble Motion on Trees. - Pierre Le Bodic; Edward Lam 001 (SOCS, 2024)

Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract). - Yue Zhang 048; Zhe Chen 016; Daniel Harabor; Pierre Le Bodic; Peter J. Stuckey (SOCS, 2024)

An abstract model for branch and cut. - Aleksandr M. Kazachkov; Pierre Le Bodic; Sriram Sankaranarayanan 002 (Math. Program., 2024)

Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities. - Yue Zhang 048; Zhe Chen 016; Daniel Harabor; Pierre Le Bodic; Peter J. Stuckey (AAAI, 2025)

Needles in the Haystack-Rapid Error Detection for Cell Tracking Solutions. - Draga Doncila Pop; Pierre Le Bodic; Juan Nunez-Iglesias (ISBI, 2025)

Interpretable Representation Learning for Additive Rule Ensembles. - Shahrzad Behzadimanesh; Pierre Le Bodic; Geoffrey I. Webb; Mario Boley (CoRR, 2025)