搜索资源列表
d
- 【问题描述】： 设有一个背包可以放入的物品重量最重为s，现有n件物品，它们的重量分别为w[0]、 w[1]、w[2]、…、w[n-1]。问能否从这n件物品中选择若干件放入此背包中，使得放入的重量之和正好为s。如果存在一种符合上述要求的选择，则称此背包问题有解（或称其解为真）；否则称此背包问题无解（或称其解为假）。试用递归方法设计求解背包问题的算法。 -【Descr iption of the problem: There is a backpack of items can be pla
beibaowenti
- 算法设计与分析实验：实现背包问题。界面友好，程序简单清晰，功能齐备。可以下载-Experimental Design and Analysis of Algorithms: The knapsack problem. Friendly interface, simple and clear procedures, functions. Can download to try
knapsackproblems
- 本程序用MFC实现了背包问题中贪婪法，动态规划法，蛮力法，分支界限法的可视化-This procedure using MFC in a knapsack problem greedy method, dynamic programming method, brute force method, branch visualization limits of the law
baggreedy
- 改写成面向对象的贪心算法（背包问题），一定容量，每个物体按效益/重量排序，本例只有三个物体-Rewritten into a greedy algorithm for object-oriented (knapsack problem), a certain capacity, for each object according to benefit/weight sorting, which in this case only three objects
beibaowenti
- 背包问题的C++算法编程。可运行。希望有帮助到大家-Knapsack problem algorithm of the C programming. Run. We want to help
tanxin
- 使用贪心算法来解决的一些实际应用问题，包括经典的背包问题-Greedy algorithm used to solve some of the practical application of issues, including the classic knapsack problem, etc.
01bagpack
- 01背包问题的回溯解法 希望给大家一点帮助-01 knapsack problem the solution back to help give us some hope
0-1knapsack_problem
- 0/1背包问题：给定n种物品和一个容量为C的背包，物品i的重量是wi，其价值为vi，0/1背包问题是如何选择装入背包的物品（物品不可分割），使得装入背包中物品的总价值最大?回溯法解决0/1背包问题-0/1 knapsack problem: given n types of items and a knapsack of capacity C, the weight of item i is wi, the value of vi, 0/1 knapsack problem is how to
POS_c
- 本程序是用PSO用于求解NP难问题，如0-1背包问题，效果很好-This procedure is used PSO for solving the NP hard problems, such as 0-1 knapsack problem, well
TestKnapsack
- 经典的背包问题用动态规划实现的JAVA代码-Classical knapsack problem using dynamic programming to achieve the JAVA code
tanxin
- 经典的背包问题用贪心法实现的JAVA代码-Classical knapsack problem greedy method using the JAVA code
Backtrack
- 0－1背包Backtrack,算法中回索法的一个好例子-0-1 Knapsack Backtrack, back Sofa algorithm a good example of
C
- C编程 完美数值算法 经典的数据结构算法，包括数论算法，图论算法，背包问题等-C programming classic numerical algorithm perfect data structure algorithms, including number theory algorithms, graph theory, algorithms, and so on knapsack problem
knapsack
- this file solve knap sack
bagproblem
- 背包问题详细讲述，解释背包问题,喜欢的下载-Knapsack problem described in detail to explain the knapsack problem, like the download
tanxin_beibao
- 以背包问题为例,介绍贪心算法解决得到一个最优值-Knapsack problem as an example to introduce a greedy algorithm to solve the optimal value
huishuo_beibao
- 回溯方法实现背包问题,有一定的容量内得到一个最优解-Knapsack problem back method has a certain capacity to be an optimal solution within
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-consuming
maxProfitBBKnapsack
- 用vc++6编写的程序，采用最大收益分枝定界法，解决背包问题。-Vc++6 prepared with the procedure for the maximum benefit from branch and bound method to solve knapsack problem.
recursiveBTKnapsack
- 用vc++6编写的程序，采用回溯法，解决背包问题。-Vc++6 with the preparation of the procedures, the use of backtracking to solve knapsack problem.