搜索资源列表
PSO-bag
- 用粒子群算法解决背包问题，能得到比较有效的结果-Particle swarm algorithm to solve knapsack problem, the results can be more effective
simknap_rec
- 简化背包算法，实用于大学生学习模拟使用，实现简单的背包问题-Simplify the knapsack algorithm, useful in the simulation students learn to use, simple knapsack problem
39975737MATLAB_gatool
- 解决0-1背包问题的遗传算法matlab程序，欢迎交流提高。-Solve the 0-1 knapsack problem genetic algorithm matlab program, welcomed the exchange increased.
d66906376b80
- 遗传算法解决TSP背包问题的源代码，包涵MATLAB程序和详尽文字算法说明-Knapsack problem genetic algorithm source code for TSP, bear with MATLAB algorithms procedures and detailed text descr iption
01
- 01背包问题，利用的是动态规划的思想，不是改进的01背包算法-01 knapsack problem, the use of dynamic programming is the idea, not the 01 knapsack algorithm to improve
packegePSO1
- 用matlab编写的一个解决0-1背包问题，其算法采用粒子群算法-use matlab software write 0-1 knapsack problem use PSO method
beibaoqiujie
- 用遗传算法计算背包问题的经典程序,word的文档里面有说明和程序。-Knapsack problem using genetic algorithm the classic program, word document which has instructions and procedures.
PSObeibao
- 粒子群算法解决背包问题，使用PSO解决背包问题-PSO algorithm to solve the knapsack problem, solve the knapsack problem using PSO
PSO-for-knapsack-problem
- pso算法在背包问题中的matlab程序。-pso algorithm in the knapsack problem in the matlab program.
TSPandBAGproblem
- 包里包含五个文件，其中ASforTSP是用蚂蚁算法解决TSP问题，Backtrack是用回溯法解决01背包问题，GAO是用遗传算法解决TSP，GreedySelector是用贪心算法解决01背包问题，MoneyChange是金额的数字与汉字的转换方案，本人作为一个学生初学编程，希望多多包涵。-Package contains five files, which ASforTSP ant algorithm to solve TSP is the problem, Backtrack 01 is
禁忌搜索解决背包问题
- 用lua编写的解决背包问题的程序，需要在lua的编译器上执行。执行成功，有结果。
背包九讲
- 本文档提供经典的背包九讲，很经典的编程算法的学习资料
simulated annealing algorithm
- 模拟退火算法的应用很广泛，可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the maximum Problem Cut (Max), 0-1
0-1背包问题
- 0-1背包问题的实现，用HTML，js编写的算法(0-1 knapsack problem implementation, using HTML, JS algorithm written)
ILOG 背包问题7物品12资源
- ILOG CPLEX 编写 背包 问题 求解(THIS is write by IBM ILOG CPLEX,the OPL language for Knapsack problem,include 12 products)
KnapSack2
- 0/1背包问题 利用的子集树，进行穷举算法实现(0/1 knapsack exhaustive problem)
课堂代码
- 背包的xml数据读取，背包的道具简易添加(Backpack XML data read, easy to add props to the backpack)
beibao
- 这是在C语言环境下利用回溯法实现0-1背包的程序(This is in the C language environment, the use of backtracking method to achieve 0-1 knapsack program)
背包九讲-2.0
- 背包九讲，主要讲述DP相关的背包算法以备大家参考(Knapsack nine lectures, mainly about DP related knapsack algorithm, for your reference)
beibao5
- /* 背包问题 问题定义： 有一个背包重量是T，有n件物品，重量分别是W0,W1...Wn-1 问能否从这n件物品中选择若干件放入背包中使其重量之和正好为T */(Tipcal package problem)