Follow
Vianney Coppé
Vianney Coppé
Verified email at uclouvain.be
Title
Cited by
Cited by
Year
Ddo, a generic and efficient framework for MDD-based optimization
X Gillard, P Schaus, V Coppé
Proceedings of the Twenty-Ninth International Conference on International …, 2021
162021
Improving the filtering of branch-and-bound MDD solver
X Gillard, V Coppé, P Schaus, AA Cire
International Conference on Integration of Constraint Programming …, 2021
112021
Branch-and-Bound with Barrier: Dominance and Suboptimality Detection for DD-Based Branch-and-Bound
V Coppé, X Gillard, P Schaus
arXiv preprint arXiv:2211.13118, 2022
32022
Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams
V Coppé, X Gillard, P Schaus
28th International Conference on Principles and Practice of Constraint …, 2022
32022
Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming
V Coppé, X Gillard, P Schaus
29th International Conference on Principles and Practice of Constraint …, 2023
2023
Accélération de l’algorithme de séparation et évaluation pour les diagrammes de décision grâce à la mémoïsation
V Coppé, X Gillard, P Schaus
JFPC, 71, 2023
2023
A Conflict Avoidance Table for Continuous Conflict-Based Search
V Coppé, P Schaus
Proceedings of the International Symposium on Combinatorial Search 15 (1 …, 2022
2022
Optimiser l’agencement d’une fabrique grâce aux diagrammes de décision
V Coppé, X Gillard, P Schaus
Journées Francophones de Programmation par Contraintes, 2022
2022
Improving the filtering of Branch-And-Bound MDD solver (extended)
X Gillard, V Coppé, P Schaus, AA Cire
arXiv preprint arXiv:2104.11951, 2021
2021
Discrete optimization with decision diagrams
V Coppé, P Schaus
UCLouvain, 2019
2019
Solving the Traveling Salesman Problem using Deep Learning: A Ground-up Approach
N Nepper, P Schaus, V Coppé, A Burlats
Ddo, un cadre générique et performant pour l’optimisation à base de diagrammes de décision
X Gillard, P Schaus, V Coppé
JFPC 2021, 1, 0
The system can't perform the operation now. Try again later.
Articles 1–12