The Power of Linear Programming for Valued CSPs
A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. This framework includ...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
2012
|