psanse / bfilt

Linux release and dataset of instances tested of the new algorithm Bfilt for Binary Constraint Satisfaction Problems. The new algorithm improves over the state-of-the-art approaches.

Bfilt dataset and converters

This site contains a (Linux) release of the algorithm Bfilt for Binary Constraint Satisfaction Problems (BCSP) (as well as the dataset of BCSP instances in XCSP3 format employed for testing) described in the following paper:

A new branch-and-filter exact algorithm for binary constraint satisfaction problems by Pablo San Segundo, Fabio Furini and Rafael León. European Journal of Operational Research, 2021 (https://doi.org/10.1016/j.ejor.2021.09.014)

In addition, the converter from XCSP3 to DIMACS format and the converter from DIMACS to MiniZinc format is provided. Detailed instructions for use are included inside the corresponding folders.

This software is for academic purposes only, see also the file LICENSE provided.

Two complete families of instances in DIMACS format (part of the dataset of the mentioned paper) are also provided. The remaining families are not available owing to space requirements, but may be obtained using the corresponding converters.

The Linux binary is available in the bin folder (instructions for use are inside), with a few sample instances.