搜索资源列表
CFbackpackPluginEasyLanguageSource
- CF背包外挂易语言源码 CF背包外挂易语言源码-CF backpack plug-in easy language source
classic-cPP-programs
- 冒泡法 附加详解 快速排序 双向冒泡 SHELL排序 进制转换 后面还有 算法的问题+解析。 背包 -Bubbling method additional explanation Quick sort Two-way bubbling SHELL sort Into system transformation There are problems+ analysis algorithm. Backpack......
Dynamic-programming-DP-backpack
- 用动态规划算法解决DP背包问题，采用C++编程-Dynamic programming algorithm to solve the DP knapsack problem, using C++ programming
beibao
- 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解： （1，4，3，2） （1，4，5） （8，2） （3，5，2）。 -Suppose there are a load of the backpack of the total volume of T
AcM-Bag
- ACM方面关于背包的问题，讲解的比较详细，可以作为ACM竞赛的参考资料~-ACM aspect on the backpack, to explain in more detail, can be used as the reference of the ACM contest
beibao
- 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为C。问应如何选择装入背包的物品，使得装入背包中物品的总价值最大?-Given the n kinds of goods and a backpack. The weight of the items i wi, the value of vi, the knapsack of capacity C Asked how to select the items of the loaded backpack, making the l
KNAPSACK
- 背包问题,动态规划实现了01背包和贪心算法部分背包-Knapsack problem, 01 backpack and full backpack
bagtest
- 背包容量为T，有N件物品，重量分别为V1,V2V3......Vn,找出m见物品，使m件物品的重量正好等于T。-Backpack capacity for T, N items, weight were V1, V2V3...... Vn, find out m see goods, to make m items is exactly equal to the weight of the T.
tanxinsuanfa
- 贪心算法应用，输入货物数目，价值，重量，背包负重，输出最佳装货方式。找零钱，输入商品件数，价格，顾客给的钱，给出要找的钱及各面值的数目-Greedy algorithm is applied, enter the number of goods, value, weight, backpack weight, and output the best loading method. Looking for change, enter the number of goods, prices, cus
Soct
- 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2），（1，4，5），（8，2），（3，5，2）。 [需求分析]-Suppose there are a load of the backpack of the total volume of T a
backpack
- 基础背包问题、用贪心算法求解最大价值问题、用动态规划算法求解最大价值问题-Basic knapsack problem, the greedy algorithm for solving the maximum value of the dynamic programming algorithm for solving the maximum value of
hdu1159
- hdu 1159 是一个背包的另一个模型 对那些复试的人很重要-hdu 1159 is another model of a backpack is very important to those who re-testing
hdu1160
- hdu 1160 这是一个hdu上的经典背包题目 不算太难 但是要细心 -hdu 1160 This is a classic backpack on the subject in a hdu not too difficult but a carefully
KGaBinnn
- 遗传算法解决复杂背包问题，用Java编写。该背包拥有3个属性，500个东西，50个包包。求解包与包之间物品重量差最小，并且同一个背包的物品属性有特殊要求。该程序容易修改。 -Genetic algorithms to solve complex knapsack problem, written in Java. The backpack has three properties, 500 things, 50 bags. Solving package and package goods
multi-knapsack(queue)
- 多重背包的单调队列解法，经过测试完美运行！-Multiple backpack monotonous queue solution has been tested and works perfect!
beibao
- 背包问题，用PSO解背包a=[95 4 60 32 23 72 80 62 65 46] 物品的体积 c=[55 10 47 5 4 50 8 61 85 87] 物品的价值 b=269 背包的重量限制-Knapsack problem, PSO solutions backpack a = [95 4 60 32 23 72 80 62 65 46] the volume of goods c = 55 10 47 5 4 50 8 61 85 87] b = 269 valu
beibao
- 01背包中的实现 用五种不同的方法实现-The 01 backpack realization using five different methods to achieve
beibao
- 用简单的c语言实现简单的01背包程序源代码，方法比较简单。-Simple c language the the 01 backpack program source code, the method is relatively simple.
0_1beibao
- 分别用回溯法和动态规划解决0-1背包问题，输出装入背包的顺序-Backtracking and dynamic programming to solve the 0-1 knapsack problem, the order in which the output is loaded backpack
Dynamic-Programming-0-1-knapsack
- 对于给定n种物品和一背包。在容量最大值固定的情况下，要求装入的物品价值最大化。-For a given n kinds of items, and a backpack. The maximum fixed capacity required to maximize the value of goods loaded.