中国数学建模-编程交流-动态规划算法_3(Chinese mathematical modeling programming exchange dynamic programming algorithm _3).doc
- 1、本文档共16页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
中国数学建模-编程交流-动态规划算法_3(Chinese mathematical modeling programming exchange dynamic programming algorithm _3)
中国数学建模-编程交流-动态规划算法_3(Chinese mathematical modeling programming exchange dynamic programming algorithm _3)
Chinese mathematical modeling programming exchange dynamic programming algorithm
Wh-ee re login, stealth user control panel, search style, forum status forum, exhibition area, community service, community leisure website, home exit
VC++, C, Perl, Asp... Programming learning, algorithms. My inbox (0)
Chinese mathematical modeling, academic area, programming, communication, dynamic programming algorithm
You are the 642nd person reading this post AP
* topic: dynamic programming algorithms
B
Class: professional swordsman
Article: 470
Points: 956
Faction: the matrix
Registration: 2003-8-28
Twenty-first floor
Dynamic programming and network flow -- dynamic programming is easy to design and easy to implement
Since the relation between graphs is complex and disorder, it is difficult to present phase features (except for special graphs, such as multi segment Graphs - see example 1), so dynamic programming is not used in graph theory. But there is a class diagram, and its point is ordered, that is, acyclic directed graphs.
In directed acyclic graphs, we can sort the points by topological ordering so that they exhibit ordered features, thus dividing the phases. The algorithm for finding the shortest path in directed acyclic graphs has shown a simple idea of dynamic programming. See the examples below.
[case 16] single source shortest path problem
Known routes and costs from A to J, as shown above, seek minimum cost routes from A to J.
Problem analysis and solution:
This problem is not obvious stages, no specific order between the points (please note with a different example), at least not in accordance with the steps needed to determine the sequence from A to D, such as a shortcut for 4, but only 3 in A-C-D, the better. It seems that the loop can not be implemented in the graph. Not really. Consider the optimal policy from A to J, and each part is also optimal (which can b
您可能关注的文档
- --华安盛道管理网 如何在单件装配企业推行精益生产(How to Huaan shendall management network, the implementation of lean production in assembly enterprises).doc
- --华安盛道管理网 定置管理(Huaan Shengdao management network management).doc
- 03判断推理---演绎推理(03 judgment reasoning deductive reasoning).doc
- 12秋《经济法概论》作业3(12 autumn, introduction to economic law, assignment 3).doc
- 2007年感动中国十大人物(2007 moved China's ten great men).doc
- 1959年资料5 中医对泄泻的认识和治疗(Understanding and treatment of traditional Chinese medicine on diarrhea in 1959 5).doc
- 2010年咨询师项目决策分析与评价精选练习及解析(Selection, practice and analysis of consultants' project decision analysis and evaluation in 2010).doc
- 2011初级士基础知识(2011 basic knowledge of Junior School).doc
- 2011年西医综合考研傲视宝典(2011 Western comprehensive examination disdain for the book).doc
- 2011年高考语文试题分类汇编—名篇名句默写(2011 college entrance exam of Chinese famous famous dictation assembly - Classification).doc
文档评论(0)