Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables

03/02/2020

∙

by   Manuel Bodirsky, et al.

∙

0

∙

share

Many combinatorial optimisation problems can be modelled as valued constraint satisfaction problems. In this paper, we present a polynomial-time algorithm solving the valued constraint satisfaction problem for a fixed number of variables and for piecewise linear cost functions. Our algorithm finds the infimum of a piecewise linear function and decides whether it is a proper minimum.