( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Better Short than Greedy: Interpretable Models through Optimal Rule Boosting.

, , , и . SDM, стр. 351-359. SIAM, (2021)

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.

Pierre Le Houcq

Pierre-Yves Le Meur

Georg-Christoph Bödicker

Ullrich Bödicker

Pierre-Yves Le Roy

 

Другие публикации лиц с тем же именем

Learning to Branch in Mixed Integer Programming., , , , и . AAAI, стр. 724-731. AAAI Press, (2016)Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)., , , , и . CoRR, (2022)Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract)., , , , и . SOCS, стр. 303-304. AAAI Press, (2024)Optimising Training for Service Delivery., , и . CP, том 210 из LIPIcs, стр. 48:1-48:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Better Short than Greedy: Interpretable Models through Optimal Rule Boosting., , , и . SDM, стр. 351-359. SIAM, (2021)Planning and Execution in Multi-Agent Path Finding: Models and Algorithms., , , , и . ICAPS, стр. 707-715. AAAI Press, (2024)Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism., , и . GREC, том 8746 из Lecture Notes in Computer Science, стр. 240-251. Springer, (2013)Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model., , , и . CPAIOR (2), том 14743 из Lecture Notes in Computer Science, стр. 56-73. Springer, (2024)Branch-and-cut-and-price for multi-agent path finding., , , и . Comput. Oper. Res., (2022)Further results on an abstract model for branching and its application to mixed integer programming., , и . Math. Program., 190 (1): 811-841 (2021)