On the valued constraint satisfaction problem
The Valued Constraint Satisfaction Problem (VCSP) is a framework which captures many natural decision and optimisation problems. An instance of the VCSP consists of a set of variables, which are to be assigned labels from a finite domain, and a collection of local constraints, each specified by a we...
Main Author: | Fulla, Peter |
---|---|
Other Authors: | Živný, Stanislav |
Published: |
University of Oxford
2018
|
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757946 |
Similar Items
-
Using constraints to break value symmetries in constraint satisfaction problems.
Published: (2005) -
Complexity classifications for the valued constraint satisfaction problem
by: Powell, Robert David
Published: (2016) -
Search in weighted constraint satisfaction problems
by: Black, Daniel Peter
Published: (2003) -
Random Constraint Satisfaction Problems
by: Amin Coja-Oghlan
Published: (2009-11-01) -
The effect of representations on constraint satisfaction problems
by: Houghton, Chris
Published: (2013)