搜索资源列表
KNAPSACK
- 0-1背包问题，用动态规划做的，很不错，供大家传阅。算法设计的原型。我给具体实现了。-0-1 knapsack problem, using dynamic programming to do, very good for your circulation. Algorithm design prototype. I gave a concrete realization.
01
- 0-1背包问题，涉及到计算哪个背包加入了所选的结果中。-0-1 knapsack problem, which involves the calculation of the backpack to join the selected results.
LV-backtrack01PACKING
- 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Given n types of items and a backpack. Item i is the weight wi, the value of vi, backpack capacity of c.
package
- 数据结构和算法分析的相关内容，这里是0/1背包问题的相关代码，将有助于你更好的学习相关内容。-Data structures and algorithm analysis of relevant content, here is the 0/1 knapsack problem related to code, will help you better learn the relevant content.
branchknapser
- 本程序实现分支界限算法求解0-1背包问题，c语言-The boundaries of the program to achieve branch 0-1 knapsack problem algorithm, c language
geneknapser
- 本程序实现遗传算法求解0-1背包问题，c语言-The genetic algorithm program to achieve 0-1 knapsack problem, c language
beibao
- 这是一个用C#编写的程序，主要是实现0-1背包问题。-this is a code written by C#.
CPP0-1bag
- 0-1背包问题的回溯法解决方案,使用的语言是c-There is 0-1bag problem.
huisufa--01beibao
- 讲述了0-1背包问题的解决，是讲课用的课件。希望对大家会有帮助-it is a problem about 0-1 bag
acokp
- 本程序实现了蚁群算法解决0/1背包问题，并作出了各代蚁群搜索到的最优解的图像-this program use aco to solve the problem of 0/1 bagpack
arithmetic
- 采用c++语言实现动态规划问题、0-1背包问题、背包问题knap1.cpp、knap.cpp、dynamic.cpp！-The c++ language realize dynamic planning 0-1 knapsack problems knapsack problem knap1. CPP knap.CPP dynamic.CPP
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