搜索资源列表
GreedyBag
- 贪心算法求背包问题,分别求出了三种标准1. 按效益值由大到小取物品. 2. 按重量值由小到大取物品 3.按比值pi/wi的值由大到小取物品 其中第3种是最优解-Greedy algorithm for knapsack problem, respectively, obtained three standard 1. Press-effective value of descending and remove things. 2. By weight the value of items
bag
- C++实现的，遗传算法解决背包问题，很经典-C++ implementation of genetic algorithm to solve knapsack problem, it is classic
BOX
- 最少背包问题：假设有许多盒子，每个盒子能保存的总重量为1.0。有N个项i1,i2,…,iN，它们的重量分别是w1,w2,…,wN。目的是用尽可能少的盒子放入所有的项，任何盒子的重量不能超过他的容量。例如，如果想的重量为0.4, 0.4, 0.6和0.6，用两个盒子就能解决。 按如下策略解决此问题：按给定的次序扫描每一个项，把每一个项放入能够容纳他而不至于溢出的最满的盒子。用优先级队列选择要装入的盒子。-Minimum knapsack problem: Suppose there are m
linux4
- linux下的MPI的C语言程序，包括背包问题的源代码和结果-MPI under linux C-language program, including the knapsack problem of the source code and results
knappara
- 本程序实现0-1背包问题的遗传算法的并行计算，mpi+c语言-This procedure achieved 0-1 knapsack problem genetic algorithm parallel computing, mpi+ c language
rrrrrrrrr
- 0-1背包问题多种解法，你也可以学习我们的-0-1 knapsack problem a variety of solution, you can also learn from our
01back
- 01背包问题算法源码，方便大家学习不同算法-01 knapsack problem algorithm source code, to facilitate them to learn from different algorithms
package
- 详细介绍有多个背包的01背包问题，此问题是NP问题，不能用一般算法解决，此资料提供了一些分析，和一些近似算法-There are a number of details of the 01 backpack knapsack problem, this problem is NP problem, the general algorithm can not be resolved, this information provides some analysis, and some approxi
test-data-for-01-knapscap-problem
- 这个是用于01背包问题的测试数据，很多论文都用这其中的数据集来测试-This is a knapsack problem for the 01 test data, a lot of papers with which the data set to test
beibao
- 背包问题，可以解决最短路径问题，或优化问题-Knapsack problem, the shortest path problem can be solved, or optimization problems
01package
- 01背包问题的贪心法源代码 供给有需要的参考-01 knapsack problem greedy algorithm source code
背包问题用lc分支限界方法
- 01背包问题，用lc分支限界方法，做的ppt-01 knapsack problem, using lc branch and bound method, do ppt
Algorithms
- 算法导论上机作业java实现，主要有背包问题，八皇后问题，递归等。-Introduction to the machine operation algorithm java to achieve, there are knapsack problem, the eight queen problem, recursive and so on.
C
- 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorit
pacel
- 经典问题----背包问题的java源代码，求解-Knapsack problem---- the classic problem of the java source code, to solve
beibaowenti
- C语言常用算法 之 背包问题 常用代码 方便使用-C language commonly used algorithm for the knapsack problem to facilitate the use of common code
Knapsack_V6.0
- vc实现的0-1背包问题，一般递归方法，动态规划方法和贪心方法-vc achieved 0-1 knapsack problem, the general recursive method of dynamic programming methods and greedy method
pso
- 修正过的pso 算法 属于离散型的pso程序，可用于变量筛选，效果不错！-Modified discrete PSO algorithm belonging to the PSO procedure, can be used for variable selection, good results!
SimulatedAnnealingAlgorithm
- matlab编制的用模拟退火算法解决0-1背包问题的具体实例-matlab prepared using simulated annealing algorithm to solve 0-1 knapsack problem specific examples of