Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables
Optimization and Control
2020-03-03 v1 Computational Complexity
Logic in Computer Science
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.
Cite
@article{arxiv.2003.00963,
title = {Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables},
author = {Manuel Bodirsky and Marcello Mamino and Caterina Viola},
journal= {arXiv preprint arXiv:2003.00963},
year = {2020}
}
Comments
10 pages. Accepted for presentation at CTW2020 and publication in AIRO Springer Series