搜索资源列表
beibao
- 求解背包问题:一个背包可装总重量 T,现有 n 个物件,其重量分别为(W1、W2、…、Wn)。问能否从这 n 个物件中挑选若干个物件放入背包中,使其总重量正好为 T ?若有解则给出全部解,否则输出无解-Knapsack problem: a backpack can be fitted to the total weight of T n existing object, its weight (W1, W2, ..., Wn). Asked whether this n objects to
beibao
- 解决算法中的数组问题,很详细很精确的解法,让你一看就明白-Solve an array of problems in the algorithm, very detailed and very accurate solution, let you see at a
beibao
- 给定一个容量为C的背包及n个重量为 wi,价值为pi的物品,要求把物品装入背 包,使背包的价值最大,此类问题为背 包问题。物品或者装入背包,或者不装 入背包,称之为0/1背包问题。 -A given a capacity for the the C of the backpack, and n a of by weight for the wi, the value of for the the the items of of pi, requirements of the
beibao
- 0-1背包问题,实现对一组货物价值最大化的筛选,应用排序和贪心算法实现。-0-1beibao problem
beibao
- 一个 数据结构 关于背包问题的求解 c语言源代码-A knapsack problem solving on c language source code
beibao
- 背包问题 C++ knapsack problem -The realization of the knapsack problem C++
beibao
- 背包问题并行算法MPI源程序 并行思想加快速度-Parallel algorithm knapsack problem thinking speed parallel MPI source
beibao
- 一个背包问题的启发式算法,在处理小数据时可以快速得到结果。-A heuristic algorithm for knapsack problem, in dealing with small data can quickly get results.
beibao-2
- 二维数组解决背包问题,不是十分经典,但对初学者十分有用-Two-dimensional array to solve knapsack problem, not very classic, but very useful for beginners
beibao
- 帮助你学习c++,能跟好的理解c++语言的作用-good code help you learn c++ program
acm-beibao
- acm动态规划背包问题详解一共有九讲,非常非常的实用-acm dynamic programming knapsack problem Elaborates a total of nine speakers, very very practical
beibao
- 这是背包问题的程序,用matlab实现,背包问题是NP完全问题-This is the knapsack problem program, using matlab , knapsack problem is a a NP-complete problem
beibao
- 一个很好的运用模拟退火解决0-1背包问题的一个例子程序-A good use of simulated annealing to solve 0-1 knapsack problem an example program
beibao
- c++实现的背包问题代码,可能不全,但是是自己写的,有需要的可以参考一下-c++ backpack problem
beibao
- 文件里面的代码主要是用递归算法,动态规划的算法,贪婪算法,回溯算法解决没有利润分配的背包问题。-File inside the code is mainly used recursive algorithm, dynamic programming algorithms, greedy algorithms, backtracking algorithm to solve knapsack problem is no distribution of profits.
BeiBao
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为:给定一组物品,每种物品都有自己的重量和价格,在限定的总重量内,我们如何选择,才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。相似问题经常出现在商业、组合数学,计算复杂性理论、密码学和应用数学等领域中。也可以将背包问题描述为决定性问题,即在总重量不超过W的前提下,总价值是否能达到V?它是在1978年由Merkel和Hellman提出的。-Knapsack problem (Kn
beibao
- 背包问题的贪心算法,对贪心算法做了很好的演绎,适合初学者学习。-Greedy algorithm
beibao
- 背包问题源代码,有详细的注释,逻辑比较清楚。-Knapsack problem source code
beibao
- 模拟退火算法是一种通用的随机搜索算法,是对局部搜索算法的扩展。与一般局部搜索算法不同,SA以一定的概率选择领域中目标值相对较小的状态,是一种理论上的全局最优算法。-Simulated annealing algorithm is a common random search algorithm is an extension of local search algorithm. Different general local search algorithm, SA with a certain
Beibao
- 实现背包问题,在限定的总重量内,我们如何选择,才能使得物品的总价格最高-Achieve knapsack problem, within a limited total weight, how we choose to make the total price of the highest items