Pierre Le Bodic

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