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 …

Single-machine scheduling where jobs have a penalty for being late or for being rejected
altogether is an important (sub) problem in manufacturing, logistics, and satellite scheduling …

This tutorial provides an introduction to the use of decision diagrams for solving discrete
optimization problems. A decision diagram is a graphical representation of the solution …

We address the one-to-one multicommodity pickup-and-delivery traveling salesman
problem, a challenging variant of the traveling salesman problem that includes the …

Abstract The Traveling Salesman Problem with Time-dependent Service times (TSP-TS) is a
generalization of the Asymmetric TSP, in which the service time at each customer is given by …

Decision diagrams (DDs) have proven to be useful tools in combinatorial optimization.
Relaxed DDs represent discrete relaxations of problems, can encode essential structural …

Multi-valued decision diagrams (MDDs) were introduced into constraint programming over a
decade ago as a powerful alternative to domain propagation. While effective MDD …

Abstract The Traveling Salesman Problem with Pickup and Delivery seeks a minimum cost
path with pickups preceding deliveries. It is important in on-demand last-mile logistics, such …

For vehicle routing problems, strong dual bounds on the optimal value are needed to
develop scalable exact algorithms as well as to evaluate the performance of heuristics. In …

We propose an optimization framework which integrates decision diagrams (DDs) and
integer linear programming (ILP) to solve combinatorial optimization problems. The hybrid …