搜索资源列表
背包算法
- 高级算法中的背包问题求解,算法简便高效,主要解决动态规划0-1背包问题-senior algorithm to solve the knapsack problem, the algorithm is simple and efficient, dynamic programming solution 0-1 knapsack problem
贪婪算法解决背包
- 运用贪婪算法能够很好解决0/1背包问题,这是我编的一个小程序,运行过很好。-greedy algorithm can be used to solve a very good 0 / 1 knapsack problem, this is my part of a small program running very good.
0-1package
- 0-1背包问题的分支限界算法实现,有详细的函数功能说明
0-1
- 算法设计与分析:动态规划解决0-1背包问题
0_1背包问题
- 经典的0-1背包问题.-classical 0-1 knapsack problem.
0-1背包
- 0-1背包问题算法在java语言的实现程序-0-1 knapsack problem algorithm java language in the realization process
0-1-bugs-question
- 0-1背包的几种算法的C++实现,包括分支限界、回溯法、贪心算法几种算法-Several 0-1 knapsack algorithm c++ implementation, including branch limit, backtracking algorithm and greedy algorithm
1
- 实现背包问题算法,并用MFC做出界面,画出曲线图。-Knapsack problem algorithm, and make the interface using MFC, draw graphs.
final_tanxin_c
- c编写程序 贪婪算法 解决0-1背包问题-0-1 tanlan SUANFA
suanfa
- 算法设计课程全部代码,包括0-1背包问题,回溯方法解n皇后问题,最大字段和,归并排序等算法,并全部包含人机交互过程-Algorithm design courses all the code, including the 0-1 knapsack problem, backtracking method to solve n-queens problem, the maximum field and, merge sort algori
optimization-packsack
- 0/1背包问题的源代码 供大家伙参考一下啦-0/1 knapsack problem of the source code for the big guy reference
01package
- 0-1背包 经典DP二维数组解法,时间复杂度及空间复杂度均为O(nv) 一维数组解法,时间复杂度为O(nv),空间复杂度为O(v)-Classical DP two-dimensional array solution, time complexity and space complexity are O (nv) One dimensional array solution, the time complexity is
0-1beibao
- 这是用MFC写的,开发环境是VC++。有软件界面,主要用于求解0-1背包问题,亲测无误。-This is written in MFC, and the development environment is VC++. It has software interface, mainly for solving 0-1 knapsack problem.
0-1背包问题
- 0-1背包问题的实现,用HTML,js编写的算法(0-1 knapsack problem implementation, using HTML, JS algorithm written)
粒子群01背包
- 用粒子群算法解决01背包问题(100个物品)从而得到最优解(The particle swarm algorithm is used to solve the 01 knapsack problem (100 items), and thus the optimal solution is obtained)
部分背包的贪心算法实现
- 通过贪心算法实现装进背包物品价值最大化,具体步骤是依次选择价值密度最大的物品放入背包(Through greedy algorithm to maximize the value of goods loaded into backpacks.)
背包
- 给定n种物品和一背包。物品i的重量是wi,体积是bi,其价值为vi,背包的容量为c,容积为d。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大?在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或者不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。试设计一个解此问题的动态规划算法,并分析算法的计算复杂性。(Given n items and a knapsack. The weight of the
背包2
- 解决背包问题的一个算法 ,可以看看的啊大大撒打算 打上单(sssfaadasdasdasfdsgdsgdssgddsgvfdasdffsfd)
遗传算法01背包问题
- 使用遗传算法解决01背包问题,并输出得到最大价值的遗传代数以及每一代的最大价值(Using genetic algorithm to solve 01 knapsack problem)
NSGA2解决0-1背包问题
- 用遗传算法解决背包问题,供大家参考交流。。。(Using genetic algorithm to solve the knapsack problem, for your reference and exchange...)