软差异约束的超弧一致性算法
A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint
摘要：
本文提出了一种实现软全异约束超弧一致性的算法.为此，我们证明和利用等价的最小成本流问题。约束的一致性可以在O（nm）时间内检查，超弧一致性在O（m）时间内实现，其中n是涉及的变量的数量，m是域的基数之和。它改进了以前不能保证超弧一致性的方法。
英文摘要：
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flow problem. Consistency of the constraint can be checked in O(nm) time, and hyper-arc consistency is achieved in O(m) time, where n is the number of variables involved and m is the sum of the cardinalities of the domains. It improves a previous method that did not ensure hyper-arc consistency.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
