This introductory chapter explains the motivation for develo** decision diagrams as a new
discrete optimization technology. It shows how decision diagrams implement the five main …

We propose a general branch-and-bound algorithm for discrete optimization in which binary
decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In …

Sequencing problems are among the most prominent problems studied in operations
research, with primary application in, eg, scheduling and routing. We propose a novel …

Finding tight bounds on the optimal solution is a critical element of practical solution
methods for discrete optimization problems. In the last decade, decision diagrams (DDs) …

Prescriptive analytics provides organizations with scalable solutions for large-scale,
automated decision making. At the core of prescriptive analytics methodology is …

We explore the idea of obtaining bounds on the value of an optimization problem from a
discrete relaxation based on binary decision diagrams (BDDs). We show how to construct a …

We introduce an iterative framework for solving graph coloring problems using decision
diagrams. The decision diagram compactly represents all possible color classes, some of …

In this paper we introduce a new method for generating heuristic solutions to binary
optimization problems. We develop a technique based on binary decision diagrams. We use …

We introduce an iterative framework for computing lower bounds to graph coloring
problems. We utilize relaxed decision diagrams to compactly represent an exponential set of …

The branch-and-bound algorithm based on decision diagrams is a framework for solving
discrete optimization problems with a dynamic programming formulation. It works by …