Musliu, Nysret; Schafhauser, Werner - In: European Journal of Industrial Engineering 1 (2007) 3, pp. 317-340
Many practical problems in mathematics and computer science may be formulated as Constraint Satisfaction Problems (CSPs …). Although CSPs are NP-hard in general, it has been proven that instances of CSPs may be solved efficiently, if they have …