搜索资源列表
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
beibao
- 背包问题 C++ knapsack problem -The realization of the knapsack problem C++
aco-01knapsackainfo
- 蚁群算法解决0-1背包问题源码及资料，蚁群优化英文版-Ant colony algorithm to solve 0-1 knapsack problem and information source, ant colony optimization English
6d5
- 王晓东《算法设计与分析》第六章第五节0-1背包问题分支限界法求解-Xiaodong " algorithm design and analysis," Chapter V 0-1 knapsack problem branch and bound method to solve
greedy-algorithm-of-package
- 用C语言写的，实现的是用贪心算法来解背包问题，在VC++里可以编译运行-Written in C language, the realization of the greedy algorithm to solve knapsack problem, where you can compile and run in VC++
pso0-1
- 粒子群算法解决0-1背包问题，输出最优解，适合初学者-Particle swarm algorithm to solve knapsack problem, suitable for beginners to see. . . . . . . . . . . . . . . . . . . . . . . .
suanfa
- 计算机算法设计与分析 0-1背包问题 士兵站队问题 最长子序列 工作分配 会场安排 -Design and Analysis of Computer Algorithms 0-1 knapsack problem question soldiers stand longest sequence assignment venue arrangements
01
- 01背包问题是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn。-01 knapsack problem is the M items removed several pieces on the space W of a backpack, each item has a volume of W1, W2 ...... Wn, with the corresponding value of P1, P2 ...... Pn.
hh
- 加界限回溯背包问题C++源代码。实现结果真确-Plus boundary backtracking knapsack problem C++ source code. Achieve accurate results
b
- 01背包问题——求最大值 非常的实用算法-01 knapsack problem- seek the maximum
k
- 背包问题 算法学习必备 是非常有用的东西-Knapsack problem algorithm learning essential
beibao
- 背包问题并行算法MPI源程序 并行思想加快速度-Parallel algorithm knapsack problem thinking speed parallel MPI source
Knapsackproblem
- 遗传算法解决01背包问题,可以用来学习和参考，有一定的价值-Genetic algorithm to solve knapsack problem 01 can be used to study and reference, there is a certain value
lvyoubeibao
- 旅游背包问题，采用近似算法BF、CF算法。题目：第i个物体大小为 Si, 箱子尺寸为c（maxSi<c). 现在有n个物体和m个箱子。请问，我们最少需要多少个箱子来储存这些物体？ 要求： 输入 文件名 输出：最少箱子数量 文件名对应的文件内容是 第一行 物体数量n 箱子尺寸C 第二行 用空格分隔的i个物体的大小 其中的数字都是整数，物体和箱子均不能分隔-Travel knapsack problem, the use of approximation algor
evolutionary-algorithm
- 二次背包问题的贪婪量子进化算法求解,对于初学者来说非常适用-Quadratic knapsack problem greed quantum evolutionary algorithm, is very suitable for beginners
KnapsackProblem
- 利用遗传算法来精确地解决背包问题的编程代码-Knapsack problem using genetic algorithms to solve programming code
knapsack
- VB背包问题遗传算法求解的源码实例,有兴趣的可以下载。-VB knapsack problem genetic algorithm source code examples, are interested in can be downloaded.
beibao
- 一个背包问题的启发式算法，在处理小数据时可以快速得到结果。-A heuristic algorithm for knapsack problem, in dealing with small data can quickly get results.
01beibao
- 用一维数组解决背包问题，十分经典，可提升空间基本没有-With a one-dimensional array to solve knapsack problem, very classic, can be basically no room for improvement
beibao-2
- 二维数组解决背包问题，不是十分经典，但对初学者十分有用-Two-dimensional array to solve knapsack problem, not very classic, but very useful for beginners