A new branch-and-filter exact algorithm for binary constraint satisfaction problems

•We design and test an exact algorithm for binary constraint satisfaction problems.•The new algorithm efficiently exploits a reduction to the k-clique problem.•Two filtering phases are developed based on colouring and SAT techniques.•We propose a new reformulation based on an independent set partition.•Extensive tests show large improvements against the state-of-the-art solvers.