In Computer Science, the Boolean Satisfiability Problem (SAT) is the problem of determining
if there exists an interpretation that satisfies a given Boolean formula. SAT is one of the first …

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 …

In view of the increasing importance of hardware parallelism, a natural extension of per-
instance algorithm selection is to select a set of algorithms to be run in parallel on a given …

We present the parallel implementation of a constraint-based Local Search algorithm and
investigate its performance on several hardware platforms with several hundreds or …

This paper presents a detailed analysis of the scalability and parallelization of Local Search
algorithms for constraint-based and SAT (Boolean satisfiability) solvers. We propose a …

Local search metaheuristics are a recognized means of solving hard combinatorial
problems. Over the last couple of decades, significant advances have been made in terms of …

This paper presents a detailed analysis of the scalability and parallelization of local search
algorithms for the Satisfiability problem. We propose a framework to estimate the parallel …

Many network design problems arising in areas as diverse as VLSI circuit design, QoS
routing, traffic engineering, and computational sustainability require clients to be connected …

Many network design problems arising in areas as diverse as VLSI circuit design, QoS
routing, traffic engineering, and computational sustainability require clients to be connected …

In this paper, we propose the use of path relinking to improve the performance of parallel
portfolio-based local search solvers for the Boolean Satisfiability problem. In the portfolio …