搜索资源列表
suanfa
- 分支限界法解决01背包问题，适用于算法上机作业-Branch and bound method to solve the 01 knapsack problem
0-1Package_c
- 0-1背包问题，C语言代码，txt文本，可以改编-0-1 package problem
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
knackpack
- 背包问题的资料，可以用来做多数背包问题。我认为是很好的使用工具-Knapsack problem that can be used to do most of the knapsack problem. I think it is good to use tools
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.
0-1
- 0-1 背包问题-动态规划法,算法设计课程作业-0-1 knapsack problem- dynamic programming, algorithm design course work
0-1cc
- 0-1背包问题-分支限界法,算法设计课程作业-0-1 knapsack problem- branch and bound algorithm design course work
0-1hs
- 0-1背包问题-回溯法,算法设计课程作业-0-1 knapsack problem- Backtracking algorithm design course work
beibao
- 背包问题的解决，，实现在最大载重量下利润最大化的问题-The solution of the knapsack problem
beibao
- 背包问题是经典的数学问题，很多问题都可以转化为该问题而解决，希望该程序对你有所帮助。-Knapsack problem
beibao
- 背包问题，也就是我们常见的那个。在很多的专题实验中都会遇到-Knapsack problem, that is, our common one. Will encounter a lot of topics experiment
huisufa
- 回溯法背包问题，很实用也是经过改进的背包问题-The backtracking knapsack problem, very practical and improved knapsack problem
test
- 模拟退火算法求解0-1背包问题。模拟退火算法求解0-1背包问题-Simulated annealing algorithm for solving knapsack problem
PSO
- matlab求解粒子群，属于0-1背包问题-matlab to solve the particle swarm, belonging to the 0-1 knapsack problem
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
QAniimprovedqu
- 量子进化算法的性能直接受量子旋转门旋转角计算方法的影响.文中提出一种改进量子进化算法，核心是设计了一种基于量子比特概率幅比值自适应计算量子旋转门旋转角的新方法，算法具有收敛速度快快与全局搜索能力强的特点.通通过011背包问题分析了新方法中相关参数对算法性能的影响，并应用算法求解物流配送路径优化问题，仿真表明改进量子进化算法性能优于量子进化算法与传统进化算法. -Quantum evolutionary algorithm performance is directly affected by
back
- 贪心法求解背包问题。txt文件数据输入与答案输出-The greedy method knapsack problem. txt file data input and answer output
Bag
- 0-1背包问题的解答,0-1背包问题的一个简单的解答，算法不是很好，蛮力算法-0-1 knapsack problem answers to the 0-1 knapsack problem with a simple answer, the algorithm is not very good, the brute force algorithm
knapsack01_backtrack
- 数据结构中回溯法求解0-1背包问题的实现-Backtracking to the 0-1 knapsack problem in the data structure