搜索资源列表
背包问题
- 经典算法之背包问题-classic algorithms knapsack problem
背包问题之贪婪算法求解C语言源代码
- 其实原来的程序也是采用了贪婪算法，不过下面程序中的beibao1函数采用了贪婪算法的另一种写法，beibao函数是以前的代码，用来比较两种算法-fact, the original procedure is used in the greedy algorithm, but the procedures below beibao1 function of the greedy algorithm used another way, be
贪婪算法解决背包
- 运用贪婪算法能够很好解决0/1背包问题，这是我编的一个小程序，运行过很好。-greedy algorithm can be used to solve a very good 0 / 1 knapsack problem, this is my part of a small program running very good.
背包问题的两种算法实现
- 本例编程实现背包问题的递归和非递归算法，让你彻底了解这种算法-the cases Programming knapsack problem of recursive and non - recursive algorithm, so you thoroughly understand this algorithm
背包问题递归算法
- 背包问题的递归算法，以C语言原代码给出，有需要的朋友 可以下载，不许要帐号，自由下载。-knapsack problem recursive algorithm to the original C language code is given, a friend in need can be downloaded allowed to account, free download.
背包问题之贪婪算法求解C语言源代码)
- 背包问题的贪婪算法，需要的下，不需要帐号的，自由的下。-knapsack problem of greedy algorithm, need, need not account, free under.
背包问题的遗传算法解法vb
- 这是一用VB解决背包问题的遗传算法元程序,程序框架清楚,应用性强-This a backpack with VB solve problems of genetic algorithm yuan procedure is a clear fr a mework and application-
backbag
- 该程序是一个背包算法,是由C++写的源程序-that the procedure was a knapsack algorithm is written in C source files
greedy_bag
- 背包算法，算法课的实验。基本上已经完善！-knapsack algorithm, the algorithm class experiment. Basically perfect!
packageone
- 背包算法和0-1背包算法,c++实现,希望对大家有帮助!-knapsack algorithm and 0-1 knapsack algorithm, c achieve, and I hope to be helpful!
背包问题的遗传算法解法
- 背包问题算法解决-Knapsack Problem Solving
背包的动态规划算法
- 背包的动态规划算法.rar-backpack dynamic programming algorithm. Rar
02164837831
- 实现背包算法密约，希望能够对大家有所帮助，水平有限，多多包涵！
使用模拟退火算法（SAA）解决0－1背包问题
- 使用模拟退火算法（SAA）解决0－1背包问题-using simulated annealing (SAA) 0-1 knapsack problem solving
0-1背包
- 0-1背包问题算法在java语言的实现程序-0-1 knapsack problem algorithm java language in the realization process
01packet
- 用4种方式写01背包算法程序，对结果进行比较
Branch_Bound_Knap
- 分支限界背包算法实现，用VC++6.0开发。
matlab程序（解决0-1背包问题）
- 使用遗传算法解决0-1背包问题，调试成功，非常适合初学者了解遗传算法和0-1背包问题(Using genetic algorithm to solve 0-1 knapsack problem, debugging is successful. It is very suitable for beginners to understand genetic algorithm and 0-1 knapsack problem.)
NSGA2解决0-1背包问题
- 用遗传算法解决背包问题，供大家参考交流。。。(Using genetic algorithm to solve the knapsack problem, for your reference and exchange...)
基于猴群算法求解0_1背包问题_徐小平
- 猴群算法是于2008年由Zhao和Tang[8]提出的一种新的用于求解大规模、多峰优化问题的智能优化算法.(The monkey swarm algorithm is a new intelligent optimization algorithm proposed by Zhao and Tang [8] in 2008 for solving large-scale and multi-peak optimization probl