搜索资源列表
yiqun_ziliao
- 蚁群算法源代码(附带蚁群算法在0-1背包问题和TSP问题中的应用资料两篇)-Ant colony algorithm source code (with ant colony algorithm in the 0-1 knapsack problem and the TSP data Problem 2)
01beibao
- 算法与数据结构——快速排序 01背包问题,是一个简单的程序,高手就不用研究了-Algorithms and data structures- quick sort 01 knapsack problem is a simple procedure, you need to conduct a study on the
01
- 01背包问题的经典实现。在VC6下面调试通过。学习算法的朋友可以借鉴一下-01 to achieve the classic knapsack problem. VC6 debugger in the following through. Learning algorithm can learn from you friends
0-1package
- 0-1背包问题的分支限界算法实现,有详细的函数功能说明 -0-1 knapsack problem branch and bound algorithm, a detailed descr iption of the function function
basicAlgorithm(pascal)
- 基本算法正稿 包括:一、数论算法;二、图论算法;三、背包问题;四、排序算法;五、高精度计算;六、 树的遍历;七 进制转换;八 全排列与组合的生成;九.查找算法;十、贪心;十一、回溯法框架;十二、DFS框架;十三、BFS框架;十五、数据结构相关算法 -Following is the basic algorithm include: number theory algorithm Second, graph theory alg
pack
- 背包问题的回溯法,用回溯法解决背包问题,区别于其他算法 -Knapsack Problem retrospective method, with backtracking to solve knapsack problem, different from the other algorithms
0-1bag
- 在c++环境下运行的程序 利用动态规划的算法思想解决0—1背包问题-In c++ Environment running the algorithm using dynamic programming ideas to solve 0-1 knapsack problem
0-1
- 算法设计与分析:动态规划解决0-1背包问题-Algorithm design and analysis: dynamic programming to solve 0-1 knapsack problem
si
- 设有一个背包可以放入的物品重量最重为s,现有n件物品,它们的重量分别为w[0]、 w[1]、w[2]、…、w[n-1]。问能否从这n件物品中选择若干件放入此背包中,使得放入的重量之和正好为s。如果存在一种符合上述要求的选择,则称此背包问题有解(或称其解为真);否则称此背包问题无解(或称其解为假)。试用递归方法设计求解背包问题的算法。-There is a backpack weight items can be placed the m
package
- 此小程序用java实现了可以分割的背包问题,开发平台是Eclipse。其中主要是用贪心算法实现背包问题,在将物品进行排序时,没有使用经典的merge-sort算法,而是直接使用了java中Arrays类的sort的方法,但要自己定义类,实现接口Comparator。-This small program using java realize the knapsack problem can be separated from the d
GA_for_Knapsack_Problem
- 遗传算法用于求解多目标背包问题,学包括基本的选择、杂交、变异等遗传算子.-Genetic algorithm for solving multi-objective knapsack problem, learning the basic choice, hybridization, mutation and other genetic operators.
Fractional_Knapsack
- 谈心算法实现0/1背包问题的解决,想学习谈心算法的可以参考-Talk Algorithm 0/1 knapsack problem, want to learn to talk algorithm can refer to
0-1beibao
- 0-1背包问题的解决,此算法基于动态规划来实现,通用性好-0-1 knapsack problem, this algorithm is based on dynamic programming to achieve, common good
pack1
- 01背包问题 用算法分之方法解决的问题-01 knapsack problem with algorithms to solve the problem of points
bagcopy
- 采用遗传算法解决0-1背包问题 并采用了二重编码形式
suanfadaquan
- 里面包含了数论算法,图论算法,背包问题,排序算法,高精度计算,树的遍历等算法代码-Which contains a number of algorithms, graph theory, algorithm, knapsack problem, sorting algorithm, high-precision calculation, the tree traversal algorithm code, etc.
Animprovedquantumevolutionaryalgorithm
- 量子进化算法的性能直接受量子旋转门旋转角计算方法的影响.文中提出一种改进量子进化算法,核心是 设计了基于量子比特概率幅比值自适应计算量子旋转门旋转角的新方法,算法具有收敛速度快和全局搜索能力强 的特点.通过011背包问题分析了新方法中相关参数对算法性能的影响,并应用算法求解物流配送路径优化问题,仿真表明改进量子进化算法性能优于量子进化算法和传统进化算法. -Quantum evolutionary algorithm per
GA
- 基于遗传算法的背包问题求解,有基本的说明和代码 其他人不需帐号就可自由下载此源码 -Based on genetic algorithms for solving knapsack problem, some basic instructions and code other people without accounts can download this free source
Antbeibao
- 用蚁群算法解决0-1背包问题,matlab实现,自己亲自写的,没问题-Using ant colony algorithm to solve 0-1 knapsack problem, matlab realize that he personally wrote, no problem
Knap2
- knap2 背包问题非递归,运用栈及回溯算法优化了一下,可以找到所有满足条件的解。 如果遇到什么问题,请发邮件至horsewhite32@hotmail.com,笔者将不胜感激 uuhorse-non-recursive knap2 knapsack problem, the use of stack and the backtracking algorithm to optimize the look, you can f