default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Le Bodic
Person information
- affiliation: Monash University, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Aleksandr M. Kazachkov
, Pierre Le Bodic, Sriram Sankaranarayanan:
An abstract model for branch and cut. Math. Program. 206(1): 175-202 (2024)- [c25]Fan Yang, Pierre Le Bodic, Michael Kamp, Mario Boley:
Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles. AISTATS 2024: 1117-1125 - [c24]Gioni Mexi, Somayeh Shamsi, Mathieu Besançon, Pierre Le Bodic:
Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model. CPAIOR (2) 2024: 56-73 - [c23]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: 707-715 - [c22]Pierre Le Bodic, Edward Lam:
Optimal Unlabeled Pebble Motion on Trees. SOCS 2024: 218-222 - [c21]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: 303-304 - [i9]Fan Yang, Pierre Le Bodic, Michael Kamp, Mario Boley:
Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles. CoRR abs/2402.15691 (2024) - 2023
- [j15]Mahboubeh Jahantab, Babak Abbasi, Pierre Le Bodic:
Farmland allocation in the conversion from conventional to organic farming. Eur. J. Oper. Res. 311(3): 1103-1119 (2023) - [c20]Yue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey:
Efficient Multi Agent Path Finding with Turn Actions. SOCS 2023: 119-127 - 2022
- [j14]Edward Lam, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey:
Branch-and-cut-and-price for multi-agent path finding. Comput. Oper. Res. 144: 105809 (2022) - [j13]Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch:
Estimating the Size of Branch-and-Bound Trees. INFORMS J. Comput. 34(2): 934-952 (2022) - [c19]Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan:
An Abstract Model for Branch-and-Cut. IPCO 2022: 333-346 - [c18]Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor:
Dual Euclidean Shortest Path Search (Extended Abstract). SOCS 2022: 285-287 - [i8]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 abs/2207.02436 (2022) - 2021
- [j12]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: 105505 (2021) - [j11]Ahmad Kazemi, Andreas T. Ernst, Mohan Krishnamoorthy, Pierre Le Bodic:
Locomotive fuel management with inline refueling. Eur. J. Oper. Res. 293(3): 1077-1096 (2021) - [j10]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic:
Learning Optimal Decision Sets and Lists with SAT. J. Artif. Intell. Res. 72: 1251-1279 (2021) - [j9]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): 811-841 (2021) - [c17]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: 12241-12248 - [c16]Ilankaikone Senthooran, Pierre Le Bodic, Peter J. Stuckey:
Optimising Training for Service Delivery. CP 2021: 48:1-48:15 - [c15]Mario Boley, Simon Teshuva, Pierre Le Bodic, Geoffrey I. Webb:
Better Short than Greedy: Interpretable Models through Optimal Rule Boosting. SDM 2021: 351-359 - [c14]Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic:
Multi-Target Search in Euclidean Space with Ray Shooting. SOCS 2021: 176-178 - [c13]Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Further Improved Heuristics For Conflict-Based Search. SOCS 2021: 213-215 - [i7]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 abs/2101.03707 (2021) - [i6]Mario Boley, Simon Teshuva, Pierre Le Bodic, Geoffrey I. Webb:
Better Short than Greedy: Interpretable Models through Optimal Rule Boosting. CoRR abs/2101.08380 (2021) - 2020
- [j8]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: 239-249 (2020) - [c12]Ryan Hechenberger, Peter J. Stuckey, Daniel Harabor, Pierre Le Bodic, Muhammad Aamir Cheema:
Online Computation of Euclidean Shortest Paths in Two Dimensions. ICAPS 2020: 134-142 - [c11]Edward Lam, Pierre Le Bodic:
New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. ICAPS 2020: 184-192 - [c10]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic:
Computing Optimal Decision Sets with SAT. CP 2020: 952-970 - [c9]Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner:
F-Cardinal Conflicts in Conflict-Based Search. SOCS 2020: 123-124 - [i5]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic:
Computing Optimal Decision Sets with SAT. CoRR abs/2007.15140 (2020) - [i4]Jinqiang Yu, Alexey Ignatiev, Pierre Le Bodic, Peter J. Stuckey:
Optimal Decision Lists using SAT. CoRR abs/2010.09919 (2020)
2010 – 2019
- 2019
- [c8]Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel:
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation. AAAI 2019: 1427-1434 - [c7]Edward Lam, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey:
Branch-and-Cut-and-Price for Multi-Agent Pathfinding. IJCAI 2019: 1289-1296 - 2018
- [j7]Pierre Le Bodic, Jeffrey William Pavelka, Marc E. Pfetsch, Sebastian Pokutta:
Solving MIPs via scaling-based augmentation. Discret. Optim. 27: 1-25 (2018) - [c6]David Cheng Zarate, Pierre Le Bodic, Tim Dwyer, Graeme Gange, Peter J. Stuckey:
Optimal Sankey Diagrams Via Integer Programming. PacificVis 2018: 135-139 - 2017
- [j6]Pierre Le Bodic, George L. Nemhauser:
An abstract model for branching and its application to mixed integer programming. Math. Program. 166(1-2): 369-405 (2017) - [j5]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): 407 (2017) - [c5]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: 473-479 - 2016
- [c4]Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, Bistra Dilkina:
Learning to Branch in Mixed Integer Programming. AAAI 2016: 724-731 - [i3]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 abs/1607.07950 (2016) - 2015
- [j4]Pierre Le Bodic, George L. Nemhauser:
How important are branching decisions: Fooling MIP solvers. Oper. Res. Lett. 43(3): 273-278 (2015) - [c3]Julien Lerouge, Pierre Le Bodic, Pierre Héroux, Sébastien Adam:
GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism. GbRPR 2015: 128-137 - [i2]Pierre Le Bodic, George L. Nemhauser:
An Abstract Model for Branching and its Application to Mixed Integer Programming. CoRR abs/1511.01818 (2015) - 2014
- [j3]Karen I. Aardal, Pierre Le Bodic:
Approximation algorithms for the transportation problem with market choice and related models. Oper. Res. Lett. 42(8): 549-552 (2014) - [i1]Karen I. Aardal, Pierre Le Bodic:
Approximation algorithms for the Transportation Problem with Market Choice and related models. CoRR abs/1410.1409 (2014) - 2013
- [c2]Pierre Héroux, Pierre Le Bodic, Sébastien Adam:
Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism. GREC 2013: 240-251 - 2012
- [j2]Stefanie Kosuch, Pierre Le Bodic, Janny Leung, Abdel Lisser:
On a stochastic bilevel programming problem. Networks 59(1): 107-116 (2012) - [j1]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): 4214-4224 (2012)
2000 – 2009
- 2009
- [c1]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: 1320-1324
Coauthor Index
aka: Daniel Damir Harabor
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
