ModRef07 Two SetConstraints For Modeling and Efficiencymodref07两集约束建模与效率.pptVIP

下载本文档

0
0
约1.02万字
约 28页
2017-03-08 发布于上海
举报
版权申诉

ModRef07 Two SetConstraints For Modeling and Efficiencymodref07两集约束建模与效率.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

ModRef07 Two SetConstraints For Modeling and Efficiencymodref07两集约束建模与效率

Sept 23, 2007 ModRef Workshop at CP-07 Two Set-Constraints For Modeling and Efficiency Willem-Jan van Hoeve Ashish Sabharwal Carnegie Mellon Univ. Cornell Univ. ModRef workshop at CP-07 Sept 23, 2007 CSPs, Global Constraints CSP: Given variables x, y, z, … with domains D(x), D(y), D(z), … and constraints over variables, find variable values such that all constraints are satisfied. Typical single-valued variable domains: discrete or continuous sets, e.g. {1,2,3,4,5}, {Su,Mo,Tu,…,Sa}, [0,1] Key to the success of CP: many useful global constraints with efficient, non-trivial filtering/propagation Very different from, say, SAT or integer programming Constraints on Set Variables Set variable: domain values are sets E.g. domain(S) = {{1,2}, {1,3},{2,3},{1,2,3}} Arise naturally in many settings, e.g.A graph (V,E) is a set of vertices and a set of edges (representation of Dooms-Katriel ’06 for MST) A set of jobs to be scheduled on a set of machinesA set of packages to be moved using a set of trucks Often “grounded-down” to single-valued variables,especially in SAT and integer programming Set Variables: The Challenge A constraint on a single set variable may capture a structure that must otherwise be represented by a global constraint on multiple single-valued variables Filtering constraints on a single set may be as complex as global filtering on multiple single-valued variables Known that combining two overlapping global constraints can easily make them NP-complete Implication: constraints on multiple set variables can be significantly harder to filter Our Contribution Efficient filtering algorithms establishing bounds consistency for set-constraints sum-free, pair-atmost1 Experiments with the Schur Number problem and the Social Golfer problem Message: in addition to providing modeling convenience, set constraints can help Significantly reduce memory requirements Increase efficiency through better filtering Background Constraints, Filtering, Propagati