摘要
文章对动态规划问题的求解方法进行了分析研究,根据问题的特点、难点和关键点做了针对性的处理,然后用Matlab做了实现尝试,从而实现了“最佳组队”和“最短路线”等问题的求解。实践证明所采用方法和程序都是有效的。
By analyzing and investigating the dynamic programming approach, an effective disposal has been done according to the problem. Then an attempt on the problems of “ Best team-forming” and “Shortest path” has been successfully made by Matlab. It is proved that the method and programme are effective.
出处
《信息工程大学学报》
2005年第3期95-98,共4页
Journal of Information Engineering University
