搜索资源列表
Knapsack
- java实现0/1背包问题,算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
LongCommonSubstrng
- 算法问题,求公共最长自序列,采用动态规划求最优解。-LCS Question DP
DP
- 利用动态规划算法,对水电站厂内机组进行负荷分配,得到机组最优负荷。-The use of dynamic programming algorithm for hydropower plant load distribution unit to obtain the optimal unit load.
optimal_triangulation
- 多边形的最优三角剖分,采用动态规划方法编程-Optimal polygon triangulation, using dynamic programming program