1 Answers
In artificial intelligence and operations research, a Weighted Constraint Satisfaction Problem is a generalization of a constraint satisfaction problem where some of the constraints can be violated and in which preferences among solutions can be expressed. This generalization makes it possible to represent more real-world problems, in particular those that are over-constrained , or those where we want to find a minimal-cost solution among multiple possible solutions.
4 views
Answered