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 …

Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there
are still many challenging problems for SAT solvers. Nowadays, extra computational power …

Abstract We propose the Embarrassingly Parallel Search, a simple and efficient method for
solving constraint programming problems in parallel. We split the initial problem into a huge …

Combinatorial Optimization is an important area of computer science that has many
theoretical and practical applications. In this thesis, we present important contributions to …

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 …

The subgraph isomorphism problem involves finding a pattern graph inside a target graph.
We present a new bit-and thread-parallel constraint-based search algorithm for the problem …

The current state of the art in subgraph isomorphism solving involves using degree as a
value-ordering heuristic to direct backtracking search. Such a search makes a heavy …

We introduce an Embarrassingly Parallel Search (EPS) method for solving constraint
problems in parallel, and we show that this method matches or even outperforms state-of-the …

Constraint Programming (CP) solvers classically explore the solution space using tree-
search based heuristics. Monte-Carlo Tree Search (MCTS), aimed at optimal sequential …

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 …