Constraint satisfaction problems (CSPs) provide a versatile framework for modelling complex decision-making tasks where a collection of variables must be allocated values that satisfy specific ...

Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.