最大流及最小费用的算法分析-algorithm analysis of maximum flow and minimum cost.docxVIP

下载本文档

16
0
约4.07万字
约 57页
2018-09-08 发布于上海
举报
版权申诉

最大流及最小费用的算法分析-algorithm analysis of maximum flow and minimum cost.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文档。上传文档

最大流及最小费用的算法分析-algorithm analysis of maximum flow and minimum cost

南南京邮电大学硕士研究生学位论文 Abstract I II Abstract In real life, there are many problems about flow. On the basis of perfect theory, with the fast development of computer technology and internet technology, the maximum flow is widely used in communication、physics、electric power and the other science. As the basement of modern communication, network-flow mainly includes the minimum flow、the minimum cost and the maximum flow、the maximum flow and so on. This paper mainly studies the use of real transportation network in the minimum cost、the minimum cost and the maximum flow and the maximum flow. It also discusses the analysis and improvement of algorithms. In the first part, this paper mainly states the development of maximum flow and the minimum cost. It also studies the current situation and the meaning of research background at home and abroad. In the second part, at first, this paper introduces the basic concept and relevant theory about the maximum flow and the minimum cost. It states the solving method and complication of Ford-Fulkerson labeling algorithm 、 the shortest augmented chain algorithm and the augmented preflow push algorithm and realize the above the algorithms with examples in detail. In the end, it simply introduces the method to resolve the minimum cost, including the way to solve the minimum cost, such as negative loop algorithm、the minimum cost algorithm、the minimum cost and the maximum flow algorithm and fixed budget the maximum flow algorithm. In the third part, on the basis of current the maximum flow algorithm, this paper puts forward a new labeling algorithm to solve the maximum flow and proof it through examples. In the fourth part, on the basis of the minimum cost algorithm, this paper puts forward a algorithm to solve the minimum cost and comes up with the best transportation program in the system of natural gas transportation. Key words: the maximum flow; the minimum cost; labeling algorithm; the augmented preflow push algorithm; negative