The Complexity of Valued Constraint Models.
The Valued Constraint Satisfaction Problem ( ) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in the framework. Using our analysis, we show that some optimisation problems, such as (s,t)-Min-Cut and Submodular Function...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Journal article |
| Language: | English |
| Published: |
Springer
2009
|