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 …

In recent years the use of decision diagrams within the context of discrete optimization has
proliferated. This paper continues this expansion by proposing the use of decision diagrams …

Numerous combinatorial optimization problems can be reduced to the optimal path problem
over directed acyclic graphs (DAGs). The constrained version of the optimal path problem …

We propose a fast method for exactly enumerating a large number of all cost-bounded
solutions for combinatorial problems using Zero-suppressed Binary Decision Diagrams …

Decision diagrams have been extensively and successfully used for solving challenging
discrete optimization problems during the last decade. This article provides a brief overview …

The Logic-Constrained Shortest Path Problem (LCSP) combines a one-to-one shortest path
problem with satisfiability constraints imposed on the routing graph. This setting arises in …

The paired job scheduling problem seeks to schedule n jobs on a single machine, each job
consisting of two tasks for which there is a mandatory minimum waiting time between the …

In this paper, we propose a fast method for exactly enumerating a very large number of all
lower cost solutions for various combinatorial problems. Our method is based on …

Tree trimming is the problem of extracting an optimal subtree from an input tree, and
sentence extraction and sentence compression methods can be formulated and solved as …

This paper deals with the constrained DAG shortest path problem (CDSP), which finds the
shortest path on a given directed acyclic graph (DAG) under any logical constraints posed …