搜索资源列表
2014072020
- 这是一个动态规划的问题，这个程序实现的是求多段图最短路径，汉诺塔和01背包问题的程序-This is a dynamic programming problem, the program is seeking to achieve the shortest path map multistage procedure Tower of Hanoi and 01 knapsack problem
part-of-pack
- 用贪心算法实现的部分背包问题，易于理解,通俗易懂-Knapsack problem with a part of the greedy algorithm, easy to understand, easy to understand
modelCenter
- 粒子群算法和基于ModelCenter求解背包问题的对比研究,包括了matlab版的粒子群算法，ModelCenter程序，以及自己的报告 -Particle swarm optimization algorithm and a comparative study based on ModelCenter knapsack problem, including the matlab version of the particle swarm algorithm, ModelCenter pr
0-1knapsack
- 0-1背包问题，通过C语言实现，可以实现0-1背包排序的问题-The problam about 0-1knapsack
BeiBao
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。相似问题经常出现在商业、组合数学，计算复杂性理论、密码学和应用数学等领域中。也可以将背包问题描述为决定性问题，即在总重量不超过W的前提下，总价值是否能达到V？它是在1978年由Merkel和Hellman提出的。-Knapsack problem (Kn
beibaoPSO
- 基于MATLAB的pso算法解决背包问题-Pso algorithm based on MATLAB to solve knapsack problem
beibao
- 背包问题的贪心算法，对贪心算法做了很好的演绎，适合初学者学习。-Greedy algorithm
GA_beibao
- 遗传算法求解背包问题Genetic Algorithm for Knapsack Problem-Genetic Algorithm for Knapsack Problem
beibaoPSO
- 粒子群算法用于背包问题情况 典型组合优化问题-Particle swarm optimization for the case of the more popular knapsack problem
GA-knapsack-
- 遗传算法解决背包问题。内含genetic工具包。-Genetic algorithm to solve knapsack problem. Contains genetic toolkit.
yichuansuanfa5
- 通过遗传算法计算多背包问题-Computing multi knapsack problem by genetic algorithm
FA2
- 一种改进的萤火虫算法解决动态0-1背包问题。经过测试，算法就有良好的性能。-Firefly Algorithm (FA), Genetic Algorithm (GA) and Differential Evolution (DE) have been widely used for static optimization problems, but the applications of those algorithms in dynamic environments are rela
ga-tabu-
- 遗传、禁忌、模拟退火等算法求解背包问题C-Genetic, contraindications, simulated annealing algorithm for knapsack problem C++
QGA-AND-GA-for-knapsack
- 本源程序里面实现了基本的遗传算法与量子遗传算法实现0-1背包问题，并对实现结果截图并分析了。-The source of which the realization of the genetic algorithm and the quantum genetic algorithm to achieve the basic 0-1 knapsack problem, and the results were analyzed.
backpack
- 典型背包问题,采用动态规划实现，希望有所帮助-backpack
Backtrack-MaxLoading
- 背包问题的变形，解决背包最大装载问题。希望有所帮助-backpack maxloading
0-1bag
- 运用贪心算法解决0-1背包问题； 运用回溯法解决0-1背包问题； 运用分支界限法解决0-1背包问题。 -Use greedy algorithm to solve 0-1 knapsack problem Use backtracking to solve the 0-1 knapsack problem Using the branch and bound method to solve the 0-1 knapsack problem.
knapsack
- 遗传算法解决背包问题，matlab 代码-Genetic algorithm to solve knapsack problem
GA-knapsack-problem
- 使用遗传算法解决经典的背包问题，即整数规划问题。-Using genetic algorithm to solve the classic knapsack problem, that is, the problem of integer programming.
2233111
- 采用分治法、动态规划算法实现0-1背包问题的求解；动态演示算法的的实现过程。要求演示界面友好、生动，易于对算法的理解-Divide and conquer, solved using dynamic programming algorithm to achieve the 0-1 knapsack problem process dynamic demonstration algorithm. The demonstration interface is friendly and vivid,