搜索资源列表
huisu
- 0-1背包问题的回溯法，如何用回溯（即深度优先搜索方法）来完成0-1背包问题-0-1Knapsacks Problem
beibao3.10
- 回溯法解决0-1背包问题 算法分析与设计实验-Backtracking to solve 0-1 knapsack problem
KnapSack
- 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
C.GA
- 遗传算法解决组合优化问题，0-1背包问题-Genetic algorithm to solve combinatorial optimization problems, 0-1 knapsack problem
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
dsadsa
- 贪心算法的实现：1、 最优装载实现 2、 0-1背包问题实现. -The greedy algorithm implemented: 1, the optimal load the implementation 2, knapsack problem is realized.
hybrid-genetic-algorithm--
- 用混和遗传算法求解0-1背包问题 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题-The hybrid genetic algorithm to solve knapsack problem
0_1package
- 0-1背包问题的c语言线性规划解决方法 一种更为简单的解法-solve the o-1 package problem in c
algorithm
- 熟悉C/C++语言的集成开发环境；通过本实验加深对分治法、贪心算法的理解。掌握贪心算法、动态规划和回溯算法的概念和基本思想，分析并掌握"0-1"背包问题的三种算法，并分析其优缺点。-Master the greedy algorithm, the dynamic programming algorithm and back of the concept and basic thought, analysis and master "0-1" knapsack problem three algo
dongtaiguihuqiubeibaowenti
- 动态规划求0/1背包问题,是一个或多个物品的重量和价值,数组中的每个元素定义一趟需要记录的数据-Dynamic programming 0/1 knapsack problem is the weight and value of one or more items, each array element defines a trip record data
test
- 模拟退火算法求解0-1背包问题。模拟退火算法求解0-1背包问题-Simulated annealing algorithm for solving knapsack problem
PSO
- matlab求解粒子群，属于0-1背包问题-matlab to solve the particle swarm, belonging to the 0-1 knapsack problem
Bag
- 0-1背包问题的解答,0-1背包问题的一个简单的解答，算法不是很好，蛮力算法-0-1 knapsack problem answers to the 0-1 knapsack problem with a simple answer, the algorithm is not very good, the brute force algorithm
knapsack01_backtrack
- 数据结构中回溯法求解0-1背包问题的实现-Backtracking to the 0-1 knapsack problem in the data structure
PackageProblem
- 0-1背包问题经典解答，有界面，有具体执行算法。-0-1 knapsack problem the classic answer, interface, and the specific implementation of the algorithm.
01Bags_BinaryTress
- 自己写的用二叉树处理经典的0-1背包问题的程序。-Write your own binary tree processing procedures of the classical 0-1 knapsack problem.
knap-error
- 利用回溯法解决0-1背包问题，希望对于开始学习算法的同学有所帮助-Backtracking to solve 0-1 knapsack problem, I hope to help students start learning algorithm
huisu
- 0-1背包问题的回溯算法，算法分析与设计-0-1 knapsack problem backtracking algorithm, algorithm analysis and design
01dongtaiguihua
- 0-1背包问题的动态规划算法，算法分析与设计-0-1 knapsack problem dynamic programming algorithm, algorithm analysis and design
01tanxin
- 0-1背包问题的贪心算法，算法分析与设计-0-1 knapsack problem of the greedy algorithm, algorithm analysis and design