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...
Main Authors: | Thapper, J, Zivny, S |
---|---|
פורמט: | Conference item |
יצא לאור: |
2012
|
פריטים דומים
-
The power of linear programming for valued CSPs
מאת: Thapper, J, et al.
יצא לאור: (2012) -
The power of linear programming for valued CSPs
מאת: Thapper, J, et al.
יצא לאור: (2015) -
The power of Sherali-Adams relaxations for general-valued CSPs
מאת: Thapper, J, et al.
יצא לאור: (2015) -
The power of Sherali-Adams relaxations for general-valued CSPs
מאת: Thapper, J, et al.
יצא לאור: (2017) -
The complexity of finite-valued CSPs
מאת: Thapper, J, et al.
יצא לאור: (2016)