( en | de | ru )

 

Disambiguation of "Cambazard, Hadrien"

Author of the publication

copydeleteadd this publication to your clipboard
Lagrangian Decomposition for Optimal Cost Partitioning.

, , , , , and . ICAPS, page 338-347. AAAI Press, (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.

Hadrien Cambazard

Hadrien Louchet

Hadrien Bride

Hadrien Perron

Hadrien Courtecuisse

 

Other publications of authors with the same name

An integer programming formulation using convex polygons for the convex partition problem., and . CoRR, (2020)Innovative ideas for teaching supports: Application to Graph theory., , , , and . CoRR, (2022)Lagrangian Decomposition for Optimal Cost Partitioning., , , , , and . ICAPS, page 338-347. AAAI Press, (2019)Knowledge Compilation for Itemset Mining., , and . ECAI, volume 215 of Frontiers in Artificial Intelligence and Applications, page 1109-1110. IOS Press, (2010)Tree Search for the Sequential Ordering Problem., , , and . ECAI, volume 325 of Frontiers in Artificial Intelligence and Applications, page 459-465. IOS Press, (2020)Lagrangian Decomposition for Classical Planning (Extended Abstract)., , , , , and . IJCAI, page 4770-4774. ijcai.org, (2020)Sister Conferences Best Papers.Analysis of Reduced Costs Filtering for Alldifferent and Minimum Weight Alldifferent Global Constraints., , and . ECAI, volume 325 of Frontiers in Artificial Intelligence and Applications, page 323-330. IOS Press, (2020)An efficient and general approach for the joint order batching and picker routing problem., , , , , and . Eur. J. Oper. Res., 285 (2): 497-512 (2020)New Randomized Strategies for the Color Coding Algorithm., , and . ECAI, volume 325 of Frontiers in Artificial Intelligence and Applications, page 466-473. IOS Press, (2020)An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem., and . SoCG, volume 189 of LIPIcs, page 20:1-20:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)