In the last decade, decision diagrams (DDs) have been the basis for a large array of novel
approaches for modeling and solving optimization problems. Many techniques now use DDs …

Decision diagrams for classification have some notable advantages over decision trees, as
their internal connections can be determined at training time and their width is not bound to …

We investigate the use of relaxed decision diagrams (DDs) for computing admissible
heuristics for the cost-optimal delete-free planning (DFP) problem. Our main contributions …

Cut generation and lifting are key components for the performance of state-of-the-art
mathematical programming solvers. This work proposes a new general cut-and-lift …

Decision diagrams (DDs) are graphical structures that can be used to solve discrete
optimization problems by representing the set of feasible solutions as paths in a graph. This …

Cut generation and lifting are key components for the performance of state-of-the-art
mathematical programming solvers. This work proposes a new general cut-and-lift …