搜索资源列表
bag
- C++语言编制的一般背包问题,可用于一般的算法实验-General knapsack problem
Knapsack
- 包含3个文件,背包问题,旅行商问题,最优BST,都是java编写的。-File have three parts .They are bag problem,knapsack problem and OptimalBST.
0_1bag
- 01背包问题,用最简单的算法解决了01背包问题-01bag question
DP_Beibao
- 这个是自己用matlab编写的简单的背包问题源程序-DP beibao
0-1beibao
- 蚁群算法求解0-1背包问题,压缩包中有详细的代码和实验报告,可以调试运行-Ant Colony Algorithm for the 0-1 knapsack problem, compressed package are detailed in the code and lab reports, debugging and running
Backbag
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为:给定一组物品,每种物品都有自己的重量和价格,在限定的总重量内,我们如何选择,才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。-Knapsack problem (Knapsack problem) is a kind of combinatorial optimization problem of NP complete. Problems can be described
beibaoPSO
- 粒子群算法解决0-1背包问题,对于n个体积为aj、价值分别为cj的物品,如何将它们装入总体积为b的背包中,使得所选物品的总价值最大。-Particle swarm algorithm to solve the 0-1 knapsack problem, for n volume for aj, value for cj items, how they are loaded in the total volume of the backpack, b, making the total value
pso_01tsp
- 粒子群背包问题,最多处理数据500条.输入 pso 回车即可-the pso algorithm can solve the TSP,the most number is 500
beibaoV2
- 背包问题,算法问题研究,这个是本书,大家共同参考,算法竞赛需要的。-Knapsack problems, the algorithm research problems, this is this book, everyone to reference, the algorithm of competition needs.
CFbackpackPluginEasyLanguageSource
- CF背包外挂易语言源码 CF背包外挂易语言源码-CF backpack plug-in easy language source
classic-cPP-programs
- 冒泡法 附加详解 快速排序 双向冒泡 SHELL排序 进制转换 后面还有 算法的问题+解析。 背包 -Bubbling method additional explanation Quick sort Two-way bubbling SHELL sort Into system transformation There are problems+ analysis algorithm. Backpack......
kp
- 在C++环境下,基于遗传算法解决背包问题。-In the C environment, based on genetic algorithm to solve the knapsack problem.
bag
- 使用C++实现的01背包小程序可以在vc下运行-a algorith of 01 bag can run in VC directly
greed-bag
- 一个贪心背包的小程序可以在VC下运行,可作为算法学习参考- a greed bag algorithm implementation can run in VC
dsadsa
- 贪心算法的实现:1、 最优装载实现 2、 0-1背包问题实现. -The greedy algorithm implemented: 1, the optimal load the implementation 2, knapsack problem is realized.
knapsack-problem
- 原创,背包问题的四种解法,回溯法,动态规划法,以及两种蛮力法,C++代码,编译运行通过,结果正确,可以比较各种方法的效率。-The original, four solutions of the knapsack problem, backtracking, dynamic programming, and two brute force method, C++ code, compile, run through, the result is correct, you can compare
Dynamic-programming-DP-backpack
- 用动态规划算法解决DP背包问题,采用C++编程-Dynamic programming algorithm to solve the DP knapsack problem, using C++ programming
beipaowenti
- 背包算法的c++简单实现,很有用的,可以-Knapsack algorithm
beibao
- 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品,能否从n件物品中挑选若干件恰好装满背包,即使w1 +w2 + … + wn=T,要求找出所有满足上述条件的解。例如:当T=10,各件物品的体积{1,8,4,3,5,2}时,可找到下列4组解: (1,4,3,2) (1,4,5) (8,2) (3,5,2)。 -Suppose there are a load of the backpack of the total volume of T
huisufa0-1
- 算法分析-回溯法,0-1背包问题,按选优条件向前搜索,以达到目标。-Algorithm- Backtracking,0-1Knapsack problem,Forward search, the optimal selection conditions in order to achieve the goal.