Ddo, a Generic and Efficient Framework for MDD-Based Optimization. - Xavier Gillard; Pierre Schaus; Vianney Coppé (IJCAI, 2020)

Improving the Filtering of Branch-and-Bound MDD Solver. - Xavier Gillard; Vianney Coppé; Pierre Schaus; André Augusto Ciré (CPAIOR, 2021)

Improving the filtering of Branch-And-Bound MDD solver (extended). - Xavier Gillard; Vianney Coppé; Pierre Schaus; André Augusto Ciré (CoRR, 2021)

Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams. - Vianney Coppé; Xavier Gillard; Pierre Schaus (CP, 2022)

A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract). - Vianney Coppé; Pierre Schaus (SOCS, 2022)

Branch-and-Bound with Barrier: Dominance and Suboptimality Detection for DD-Based Branch-and-Bound. - Vianney Coppé; Xavier Gillard; Pierre Schaus (CoRR, 2022)

Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming. - Vianney Coppé; Xavier Gillard; Pierre Schaus (CP, 2023)

Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams. - Vianney Coppé; Xavier Gillard; Pierre Schaus (CPAIOR (1), 2024)

Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection. - Vianney Coppé; Xavier Gillard; Pierre Schaus (INFORMS J. Comput., 2024)

Advances in discrete optimization with decision diagrams: dominance, caching and aggregation-based heuristics. - Vianney Coppé (2024)

A Dynamic Programming Approach for the Job Sequencing and Tool Switching Problem. - Emma Legrand; Vianney Coppé; Daniele Catanzaro; Pierre Schaus (CPAIOR (2), 2025)