Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables

Abstract

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.

10 pages. Accepted for presentation at CTW2020 and publication in AIRO Springer Series