2 code implementations • 22 Nov 2022 • Vianney Coppé, Xavier Gillard, Pierre Schaus
The branch-and-bound algorithm based on decision diagrams introduced by Bergman et al. in 2016 is a framework for solving discrete optimization problems with a dynamic programming formulation.
1 code implementation • 24 Apr 2021 • Xavier Gillard, Vianney Coppé, Pierre Schaus, André Augusto Cire
This paper presents and evaluates two pruning techniques to reinforce the efficiency of constraint optimization solvers based on multi-valued decision-diagrams (MDD).
