( en | de | ru )

 

Disambiguation of "Bodic, Pierre Le"

Author of the publication

copydeleteadd this publication to your clipboard
Branch-and-Cut-and-Price for Multi-Agent Pathfinding.

, , , and . IJCAI, page 1289-1296. ijcai.org, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pierre Le Houcq

Pierre-Yves Le Meur

Georg-Christoph Bödicker

Ullrich Bödicker

Pierre-Yves Le Roy

 

Other publications of authors with the same name

An Abstract Model for Branching and its Application to Mixed Integer Programming., and . CoRR, (2015)Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)., , , , and . CoRR, (2022)New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem., , , and . Comput. Oper. Res., (2021)Learning to Branch in Mixed Integer Programming., , , , and . AAAI, page 724-731. AAAI Press, (2016)Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism., , and . GREC, volume 8746 of Lecture Notes in Computer Science, page 240-251. Springer, (2013)Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth., and . Theor. Comput. Sci., (2020)Optimal Decision Lists using SAT., , , and . CoRR, (2020)Better Short than Greedy: Interpretable Models through Optimal Rule Boosting., , , and . SDM, page 351-359. SIAM, (2021)Optimising Training for Service Delivery., , and . CP, volume 210 of LIPIcs, page 48:1-48:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Estimating the size of search trees by sampling with domain knowledge., , , , and . IJCAI, page 473-479. ijcai.org, (2017)