搜索资源列表
SimulatedAnnealingAlgorithm
- matlab编制的用模拟退火算法解决0-1背包问题的具体实例-matlab prepared using simulated annealing algorithm to solve 0-1 knapsack problem specific examples of
an
- 利用模拟退火解决0-1背包问题，适合初学者。-The use of simulated annealing to solve 0-1 knapsack problem, suitable for beginners.
NIP
- matlab 7.0 以上版本提供了强大的优化工具箱，但在整数规划方面，只提供了bintprog（）这个m文件以求解0－1整数规划，而对于一般的整数规划模型没有具体的算法提供。我们一般情况只是用最简单的分值定界思想编写matlab程序求解整数规划问题，但效率低下，如何利用求解整数规划的先进算法编写matlab程序提上日程，香港大学的李端和复旦大学编写的《Nonlinear Integer Programming》(非线性整数规划)为编写解决整数规划问题提供强大有效的算法，其中算法针对具体问题包括
0-1-knapsack-problem
- 模拟退火解决0-1背包问题，初学者可以借鉴-Simulated annealing to solve 0-1 knapsack problem, beginners can learn from
1
- Matlab code for knapsack
SA
- 这是用模拟退火算法解决0-1背包问题，下载后可直接运行，可以帮助有需要对模拟退火算法进行了解的朋友。-This is a simulated annealing algorithm to solve the 0-1 knapsack problem, after downloading, can be directly run, you can help those in need of the simulated annealing algorithm to find out about fr
simulateanneal
- 一个解决0-1背包问题的模拟退火程序，希望给有需要的人帮助-A solution to the 0-1 knapsack problem simulated annealing process, hoping to help those in need
invst2
- 用matlab实现投资问题（类似于0-1背包问题，但更复杂）的动态规划-Problem with matlab realized investment (like the 0-1 knapsack problem, but more complex) dynamic programming
packegePSO1
- 用matlab编写的一个解决0-1背包问题，其算法采用粒子群算法-use matlab software write 0-1 knapsack problem use PSO method
beibaoPSO
- 粒子群算法解决0-1背包问题，对于n个体积为aj、价值分别为cj的物品，如何将它们装入总体积为b的背包中，使得所选物品的总价值最大。-Particle swarm algorithm to solve the 0-1 knapsack problem, for n volume for aj, value for cj items, how they are loaded in the total volume of the backpack, b, making the total value
PSO
- matlab求解粒子群，属于0-1背包问题-matlab to solve the particle swarm, belonging to the 0-1 knapsack problem
Knapsack-problem-with-GA
- solving knapsack 0,1 problem with GA in matlab
SAPSO
- 0-1背包问题是学习算法时一个非常常用的简单问题，可以用多种智能优化算法实现，这里用到了蚁群算法和模拟退火算法还有两种方法的结合三种方法来实现。-0-1 knapsack problem is a simple learning algorithm is a very common problem, and can use a variety of intelligent optimization algorithm, ant colony algorithm and simulated ann
0-1beibao--QGA
- 基于量子遗传算法的0-1背包问题matlab-Matlab genetic algorithm based on quantum 0-1 knapsack problem
knapsack.m
- KNAPSACK Solves the 0-1 knapsack problem for positive integer weights - dynamic programming
ant-colony-algorithm-
- 现代优化算法,蚁群算法解决0-1背包问题-Modern optimization algorithm, ant colony algorithm to solve 0-1 knapsack problem
GA0-1
- 0-1背包问题遗传算法，包含精英选择和非精英选择-0-1 knapsack problem algorithms, comprising elite and non-elite choose
genetic-algotithm
- 遗传算法解决0-1背包问题，并有其他非遗传算法解决该问题，两种方法功能的对比-Genetic algorithm solve the 0-1 knapsack problem and other approaths to solve the same problem.The comparation of the two methods.
0-1beibaowenti
- 应用禁忌搜索算法解决0-1背包问题，可以快速得到最优结果，用matlab实现-Application of tabu search algorithm to solve 0-1 knapsack problem, you can quickly get the best results, using matlab realize
应用禁忌搜索算法解决0-1背包问题
- 利用禁忌搜索算法求解0-1背包问题。禁忌搜索算法相比其他搜索算法更优，设置藐视规则来避免陷入局部最优解。(Solve 0-1 Knapsack Problem based on Tabu search. The tabu search algorithm is superior to other search algorithms and sets contempt rules to avoid falling into local optimal solutions.)