搜索资源列表
bags
- 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
galy
- 遗传算法解决的背包问题，初学者遗传算法的同学必看。-Genetic algorithm to solve the knapsack problem, genetic algorithm beginner students must-see.
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题，遗传算法，基于遗传算法的背包问题求解-Knapsack problem, genetic algorithm, based on genetic algorithms for solving knapsack problem
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题，遗传算法，GAs，基于遗传算法求解背包问题，源码，方法-Knapsack problem, genetic algorithms, GAs, Knapsack Problem Based on Genetic Algorithm
simulateanneal
- 一个解决0-1背包问题的模拟退火程序，希望给有需要的人帮助-A solution to the 0-1 knapsack problem simulated annealing process, hoping to help those in need
yichuansuanfa
- 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。-The greedy repair method and genetic algorithm are combined to form hybrid genetic algorithm, and solve the classical knapsack problem.
0-1beibao
- 0-1d背包问题实验报告 完整的程序 已经运行过的 -0-1d knapsack full lab report procedure has been run-off
knapsackAlgorithm
- 遗传算法实现背包问题的matlab代码，分享给大家-Knapsack problem genetic algorithm matlab code to share for everyone
ss
- 遗传算法解决背包问题，其中包括算法编码初始化，交叉，变异和惩罚策略，很好的解决了背包问题-Genetic algorithm to solve knapsack problem, including the coding algorithm initialization, crossover, mutation and punishment strategy, a good solution to the knapsack problem
bagPSO
- matlab 用PSO 解决背包问题-matlab solve the knapsack problem with PSO
bag-C-Algorithm
- 背包问题系列算法详解 背包问题是一个关于最优解的经典问题。通常被讨论的最多的，最经典的背包问题是0-1背包问题(0-1 Knapsack Problem)。它是一切背包问题及相关背包问题的基础。本篇博文将详细分析0-1背包问题，并给出0-1背包问题的几种解法，同时也对0-1背包问题的内涵进行延伸，丰富其外延至完全背包问题和多重背包问题，并给出背包问题的算法实现过程，希望对大家有帮助。-Detailed Algorithm for Knapsack Problem Series
beibaowenti
- 用matlab编程解决背包问题 可以运行 收敛效果好 附图-Solve the knapsack problem with the matlab programming convergence effect can run photos
PSO
- 粒子群算法解决背包问题。包含matlab 源程序，和一份报告。我的一份作业-Particle swarm algorithm to solve knapsack problem. Matlab source code included, and a report. I have a job
39975737MATLAB_gatool
- 解决0-1背包问题的遗传算法matlab程序，欢迎交流提高。-Solve the 0-1 knapsack problem genetic algorithm matlab program, welcomed the exchange increased.
packegePSO1
- 用matlab编写的一个解决0-1背包问题，其算法采用粒子群算法-use matlab software write 0-1 knapsack problem use PSO method
PSObeibao
- 粒子群算法解决背包问题，使用PSO解决背包问题-PSO algorithm to solve the knapsack problem, solve the knapsack problem using PSO
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
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)