文件名称:01knap_Dynamic_Programming
介绍说明－－下载内容均来自于网络，请自行研究使用
本文通过研究动态规划原理，提出了根据该原理解决０／１背包问题的方法与算法实现，并对算法的正确性作了验证．观察程序运行结果，发现基于动态规划的算法能够得到正确的决策方案且比穷举法有效．-through research paper on dynamic programming, According to the principle of resolving the 0/1 knapsack problem with the algorithm, the algorithm was verified the correctness. Observation running findings, based on dynamic programming algorithm can be the correct decision than a program exhaustive method effective.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
解01背包问题的动态规划算法.doc