2 papers
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…
math.LO2018
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. It is desirable to classify the computational complexity of VCSPs dependin…