搜索资源列表
背包算法
- 高级算法中的背包问题求解,算法简便高效,主要解决动态规划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-1背包的回溯算法
- 回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
0-1背包的动态规划算法
- 动态规划0-1背包问题-Dynamic Programming 0-1 knapsack problem
0-1背问题
- 0-1背包问题 可以提供在背包方面遇到问题的学生或者有需要的人.-0-1 knapsack problem can provide a backpack problems encountered students or those who are in need.
背包测试集
- 背包问题的测试数据
12.18
- 用粒子群算法解决背包问题
0.背包问题C语言算法
- 给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 ,
GQA.rar
- 遗传量子算法求解背包问题Matlab源码,Quantum Genetic Algorithm for Knapsack Problem
01back
- 01背包问题算法源码,方便大家学习不同算法-01 knapsack problem algorithm source code, to facilitate them to learn from different algorithms
beibao
- 背包问题,可以解决最短路径问题,或优化问题-Knapsack problem, the shortest path problem can be solved, or optimization problems
Algorithms
- 算法导论上机作业java实现,主要有背包问题,八皇后问题,递归等。-Introduction to the machine operation algorithm java to achieve, there are knapsack problem, the eight queen problem, recursive and so on.
SimulatedAnnealingAlgorithm
- matlab编制的用模拟退火算法解决0-1背包问题的具体实例-matlab prepared using simulated annealing algorithm to solve 0-1 knapsack problem specific examples of
beibao
- 通过贪心算法实现背包问题,可实现小规模背包问题-Through the greedy algorithm knapsack problem, enabling small-scale knapsack problem
package
- 动态规划的背包问题,包括讲解,源代码还有详细的例证。-Dynamic programming knapsack problem, including explanations, there is a detailed source code examples.
TSP
- 解决背包问题 自动求解最大价值 利益最大化问题-Automatically solve the Knapsack Problem to maximize the interests of maximizing the value of solving the problem
knapsack
- 背包问题,每类物品个数不限,使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
01pack
- 用动态规划,贪心算法等算法实现01背包问题-Using dynamic programming, greedy algorithm knapsack problem algorithm 01
01bag
- 用蛮力法,回溯法,分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
beibaowenti
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack