文件名称:Knapsack_problem3
介绍说明--下载内容来自于网络,使用问题请自行百度
动态规划算法实现的背包问题:// 背包问题,容量m,n种货物,分别重量W1,W2......Wn,利润分别P1,P2......Pn,求最大利润
-Knapsack problem dynamic programming algorithm:// knapsack problem, the capacity of M, N type of cargo weight, respectively W1, W2... Wn, profits were P1, P2... Pn, maximum profit
-Knapsack problem dynamic programming algorithm:// knapsack problem, the capacity of M, N type of cargo weight, respectively W1, W2... Wn, profits were P1, P2... Pn, maximum profit
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Knapsack_problem3.h
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.