7 citations · 9 across the 6 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020★ 7 cited
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
Caterina Viola, Stanislav Zivny
Convex relaxations have been instrumental in solvability of constraint satisfaction problems (CSPs), as well as in the three different generalisations of CSPs: valued CSPs, infinit…
math.OC2020
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Many combinatorial optimisation problems can be modelled as valued constraint satisfaction problems. In this paper, we present a polynomial-time algorithm solving the valued constr…