搜索资源列表
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
GA
- 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
beibaowent
- 一群算法解决背包问题 -A group of algorithms to solve knapsack problem a group of algorithms to solve knapsack problem
KnapsackProblem
- 基本遗传算法带最优保存思想的背包问题，其中，目标值那段代码使用的是惩罚函数法，选择是概率选择，交叉是双点随机交叉，变异是概率变异-The basic genetic algorithm with elitist thinking knapsack problem, which is a target that part of the code using penalty function method, choice is the probability of selection, crosso
0-1背包问题
- 0-1背包问题的实现，用HTML，js编写的算法(0-1 knapsack problem implementation, using HTML, JS algorithm written)
c++实现0-1背包问题
- 用C++工具，使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
背包问题测试数据
- 可以解决背包问题没有合理数据的程序()
ILOG 背包问题7物品12资源
- ILOG CPLEX 编写 背包 问题 求解(THIS is write by IBM ILOG CPLEX,the OPL language for Knapsack problem,include 12 products)
粒子群01背包
- 用粒子群算法解决01背包问题（100个物品）从而得到最优解(The particle swarm algorithm is used to solve the 01 knapsack problem (100 items), and thus the optimal solution is obtained)
背包问题动态规划详解
- 0/1背包问题动态规划详解及C代码 动态规划是用空间换时间的一种方法的抽象。(0/1 knapsack problem dynamic programming detailed and C code Dynamic programming is the abstraction of a method of replacing time with space.)
背包问题
- 算法效果较为良好，实现背包问题价值最大，采用遗传算法实现的比较不错的结果(The algorithm effect is good, the maximum value of the knapsack problem, genetic algorithm is used to achieve good results)
贪心算法背包问题
- 一个简单贪心算法的研究，背包问题，供大家浏览参考。(A simple greedy algorithm research, knapsack problem, reference for browsing.)
背包问题课程设计报告
- 已知n个物体的重量依次为W1>W2>W3>…….Wn，一个背包可以容纳物体的重量为W,将这些物体放入背包，要求所放置的物体的重量正好为W。(There are something,the number is n,the weight is w1>w2>w3>...wn,a bag can hold a weight of w,put these things into the bag,is just the weight.)
背包问题
- 贪心算法解决背包问题：给定n种物品和一个背包。物品i的重量是Wi，其价值为Vi，背包的容量为C。应如何选择装入背包的物品，使得装入背包中物品的总价值最大?(The greedy algorithm solves the knapsack problem: a given n item and a backpack. The weight of the item I is Wi, its value is Vi, and the capacity of the knapsack is C. How
贪心法求背包问题
- 贪心法求背包问题，如何选择使得背包中物品价值最大(A greedy method for the problem of knapsack)
回溯法求解0-1背包问题
- 文件包括回溯法求解0-1背包问题的C++源程序，包括运行界面(The file includes a backtracking method for the C++ source program for solving 0-1 knapsack problems, including the running interface)
PSO算法解决背包问题
- 粒子群算法与多目标优化问题的结合，解决背包问题实例(Combining particle swarm optimization with multi-objective optimization, we solve knapsack proble)
matlab程序（解决0-1背包问题）
- 使用遗传算法解决0-1背包问题，调试成功，非常适合初学者了解遗传算法和0-1背包问题(Using genetic algorithm to solve 0-1 knapsack problem, debugging is successful. It is very suitable for beginners to understand genetic algorithm and 0-1 knapsack problem.)
NSGA2解决0-1背包问题
- 用遗传算法解决背包问题，供大家参考交流。。。(Using genetic algorithm to solve the knapsack problem, for your reference and exchange...)