组合优化中的命题逻辑——以图顶点染色问题为研究介质-propositional logic in combinatorial optimization —— graph vertex dyeing problem as research medium.docxVIP

下载本文档

40
0
约5.38万字
约 59页
2018-09-09 发布于上海
举报
版权申诉

组合优化中的命题逻辑——以图顶点染色问题为研究介质-propositional logic in combinatorial optimization —— graph vertex dyeing problem as research medium.docx

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

组合优化中的命题逻辑——以图顶点染色问题为研究介质-propositional logic in combinatorial optimization —— graph vertex dyeing problem as research medium

华中科技大学硕士学位论文华中科技大学硕士学位论文 II II Abstract As a branch of optimization, combinatorial optimization is a central topic in computer science and operations research. Its domain is optimization problems where the set of feasible solutions is discrete or can be reduced to a discrete one, and the goal is to find the best possible solution. Combinatorial optimization has numerous real applications such as job shop scheduling, planning, resource allocation, vehicle routing problem, integer programming, and cutting stock problem. In this modern time where maximizing benefit and minimizing resource consuming become more and more important, combinatorial optimization is often crucial for many economical actors to be competitive for increasing their benefit and reducing the negative impact of their activities to the environment. Combinatorial optimization problems are often NP-hard. In other words, for all but the smallest problems, finding global optimum solutions is computationally complex. In many real cases, intuitive and straightforward solutions are simply used that could be far from the optimum. Therefore, relatively small progress in solving these problems can give a significant profit in practice. Furthermore, many combinatorial optimization problems are related with each other, progress in solving one problem can be directly or indirectly adapted to solve other ones. The propositional SATisfiability (SAT) problem is the first problem proven to be NP-Complete. SAT is the prototype of all NP-complete problems and captures intensive attention of researchers over 60 years. There is an international research community for SAT and an annual international conference ranked “A” on SAT. However, the real application of SAT is rather limited, because propositional reasoning is a very low-level reasoning. Furthermore, SAT instances always lose the structural information of the original problems, making their solving generally harder. III III On the contrary, Vertex Colo