Decision diagrams for decomposed mixed integer linear programs

A recent development in the field of discrete optimization is the combined use of (binary) decision diagrams (DD) and branch and bound for optimization. This method has been shown to outperform integer linear programming on several classic problems. The performance of DDs in integer optimization raises the question if this method can be extended...