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 …

As multi-core computing is now standard, it seems irresponsible for constraints researchers
to ignore the implications of it. Researchers need to address a number of issues to exploit …

Numerical algorithms to solve mathematical optimization problems efficiently are essential to
applications in many areas of engineering and computational science. To solve optimization …

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 …

Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete
optimization. However, the field of decision diagrams is relatively new, and is still …

This paper presents and evaluates two pruning techniques to reinforce the efficiency of
constraint optimization solvers based on multi-valued decision-diagrams (MDD). It adopts …

Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete
optimization. However, the field of decision diagrams is relatively new, and is still …

Finding a maximum clique in a given graph is one of the fundamental NP-hard problems.
We compare two multicore thread-parallel adaptations of a state-of-the-art branch-and …

Dynamic programming (DP) is a framework used in multiple disciplines to solve decision-
making problems. In particular, in computer science and operations research (OR), DP …

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 …