搜索资源列表
knapsack.ok
- 是一个背包算法程序，可以实现简单的背包原理算，对理解这一算法很有帮助。-this is a algorithm of napsake, can be achive application of napsake, it is useful to understanding the algorithm.
beibaowent
- 一群算法解决背包问题 -A group of algorithms to solve knapsack problem a group of algorithms to solve knapsack problem
package-algorithm
- 0、1背包算法，一个包内存放不超过限制重量的物体，同时价值最大-0、1 package algorithm
xujinpeng-matlab
- 遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。-Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab
bag
- 用Visual C++编写的程序，利用贪心算法实现背包问题-Using Visual C++ to prepare the procedures for implementation the use of greedy algorithm knapsack problem
i-ant
- 采用了基本的蚁群算法来求解0-1背包问题，该算法不仅可以对0-1背包问题进行求解，还可以对多维背包问题进行求解。-Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimension
gabags
- 网站上关于遗传算法开发可谓工具箱满天飞。可工具箱超级难用。鉴于此，本人自己完全用matlab实现遗传算法解决多背包问题并留了qq。-Web site development on the genetic algorithm toolbox is all over the place. Toolbox can be super hard to use. In view of this, I am not at all with the r
GQA
- 遗传量子算法求解背包问题Matlab源码-Quantum Genetic Algorithm for Knapsack Problem
beibao
- 用动态规划 实现了背包算法 结果还不错 -Knapsack algorithm achieved good results
beibao
- 背包问题的主函数很有用啊 本程序主要用到遗传算法-背包
matlab
- 不错的程序，欢迎下载，登山算法，解决背包问题，不错-Good program, please download, climbing algorithm to solve knapsack problem, yes
beibao1
- 背包算法，计算机算法经典算法用c实现，很有用的小程序-背包
yuandaima
- 一般背包问题的贪心算法 Dijkstra算法求解单源最短路径问题 N皇后问题 Prim算法 Kruskal算法代码-The general knapsack problem greedy algorithm Dijkstra' s algorithm for single-source shortest path algorithm N Queen' s problem Kruskal Algorithm Prim code
Original_algorithm_for_backpack
- 原创的背包算法原程序。n个物品，对物品i，价值为p[i]，质量为w[i]，背包容量为W。如何选取物品装入背包，使背包中的物品的总价值最大。 -Original algorithm for the original procedure backpack. n of items, on item i, the value of p [i], the quality of w [i], knapsack capacity W. How t
01package
- 01背包算法 解决算法 与众大侠一起参考 交流 -01 knapsack algorithm to solve algorithm and the public with reference to the exchange of heroes
bbwt
- 遗传算法解决背包问题，即装入物体容量有限，每个物体有不同价值，使得最终价值最高。-Genetic algorithm to solve knapsack problem, namely the limited capacity of loaded objects, each object has a different value, making the final value.
GaBin
- 遗传算法解决复杂背包问题，用Java编写。 该背包拥有3个属性，500个东西，50个包。 求解包与包之间物品重量差最小，并且同一个背包的物品属性有特殊要求。 该程序容易修改。-Genetic Algorithm on Bin Packing Proglem. 500 items, 3 parameters of each item. 50 containers, target: All 50 containers h
KnapsackProblem
- 这是用MATLAB编写的模拟退火算法求解背包问题的程序-This is prepared using MATLAB algorithm simulated annealing procedure for Knapsack Problem
ACO_0_1_bag
- 蚁群算法解0-1背包问题 内附测试文件 解的质量一般叫好，但是背包数增加时，耗时较长-Ant Colony Algorithm for 0-1 Knapsack Problem solution document containing test the quality of the general good, but the increase in the number of backpack, the longer time-
monituihuo_beibao
- 模拟退火算法解决背包问题，使得背包能得到最好的利用。-Simulated annealing algorithm to solve knapsack problem, the backpack can be the best possible use.