固定变量数的分段线性值约束满足问题
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables
摘要：
许多组合优化问题可以建模为有值约束满足问题。本文提出了一种多项式时间算法，用于求解变量个数固定且代价函数为分段线性费用函数的有值约束满足问题。我们的算法找到一个分段线性函数的下确界，并决定它是否是一个适当的最小值。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
