基于流的SEQUENCE和相关全局约束的表示器
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
摘要：
我们提出了新的过滤算法的SEQUENCE约束和一些扩展的SEQUENCE约束的基础上网络流。我们在搜索树的一个分支上在$O(n^2)$时间内对SEQUENCE约束强制域一致性。这在现有的最佳域一致性算法的基础上改进了$O(\log n)$。在这些算法中使用的流是从一个线性规划。它们中的一些与用于传播全局约束（如GCC）的流不同，因为变量的域被编码为边缘上的成本而不是容量。这样的流是有效的，保持边界的一致性在大型域，并可能是有用的其他全球性的约束。
英文摘要：
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE constraint in $O(n^2)$ time down a branch of the search tree. This improves upon the best existing domain consistency algorithm by a factor of $O(\log n)$. The flows used in these algorithms are derived from a linear program. Some of them differ from the flows used to propagate global constraints like GCC since the domains of the variables are encoded as costs on the edges rather than capacities. Such flows are efficient for maintaining bounds consistency over large domains and may be useful for other global constraints.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
