搜索资源列表
01
- 动态规划算法之0-1背包问题算法的实现。-Dynamic programming algorithm of 0-1 knapsack problem algorithm.
01knapsack
- 01背包动态规划法的cpp文件 直接可用-01 knapsack dynamic programming
GA01knapsack
- 用VC++编程运用遗传算法及其改进模式求解01背包问题-VC++ programming with the use of genetic algorithm and its improved model for solving knapsack problem 01
c2
- c++， 动态规划解决01背包问题-c++, 01 knapsack problem dynamic programming to solve
01knapsack
- 运用动态规划实现01背包的问题，c++编写，值得学习-01knapsack，Dynamic programming
pakage
- 01背包问题：给定n种物品和一个背包。物品i的重量是wi,其价值为vi,背包的容量为c.问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。-01 knapsack problem: Given n types of items and a backpack. Item i of the weight of wi, the value of vi, c. Q backpack with a capacity of how to choose the items into the bac
CPP01beibao
- 使用动态规划法求解01背包问题，语言背景是c++语言-01 method using dynamic programming knapsack problem, language background is c++ language
01beibao(dongtaiguihua)
- 01背包问题的动态规划算法，能运行，我调好的-01 knapsack problem dynamic programming algorithm, to run, I am a good tune
01beibao
- c++中运用动态规划解决01背包问题可以运行，有汉字说明-c++ using dynamic programming to solve the knapsack problem can run 01, with characters that ~ ~
middle
- 动态规划求解01背包问题，使用VC++6.0开发，C-dynamic program for 0-1 package problem
01bag_problem
- 特殊的01背包（原算法分析题4-3） 问题描述：01背包是在N件物品取出若干件放在空间为C的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn，并取得最大价值。普通的01背包中物品的重量和价值没有明确的关系，这里定义一种特殊的01背包：向背包中放入的物品的价值和体积成反比，也就是价值越高，体积越小，注意这里物品价值和体积的乘积并不是固定值。例如：如下的物品满足这个“特殊的01背包”,5件物品: 物品1,价值 v=6,体积w=20 物品2,价值 v=1,体
0-1-knapsack-problem
- 01背包是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。在本例中所有数值均为整数-01 M items in the backpack is out of a number of pieces on the space W of the backpack, the size of each item as W1, W2 ... ... Wn, corresponding to the value of
01bag
- 01背包问题：从这n件物品中选择若干件放入此背包，使得放入的重量之和正好为S。-01 knapsack problem: n items selected from a number of pieces into the bag, so just put the weight of the sum of S.
01-knapsack-problem
- 使用c++实现了0-1背包问题的算法，根据要求找出最佳的选项放入背包-Using c++ implementation of the 0-1 knapsack problem algorithms required to find the best option backpack
fenzhi
- 分治法源码，01背包问题，经典的01背包问题-Divide and conquer source, 01 knapsack problem
Kruskal
- 01背包問題程式碼，上課使用的!!作業一完整版-01 knapsack problem code, class to use!! Operating a full version
dongtaiguihua01beibaoC
- 自己在VC中运行通过的动态规划的01背包C语言版感兴趣的朋友可以下载-Themselves in the VC run through the 01 backpacks of dynamic programming of interest to a friend C-language version can be downloaded
01
- 0-1背包问题，涉及到计算哪个背包加入了所选的结果中。-0-1 knapsack problem, which involves the calculation of the backpack to join the selected results.
01Backpack
- 01背包问题的C++实现，包含Knapsack算法以及改进后的Knapsack算法。参考书籍：《算法设计与分析》。-01 knapsack problem of C++ implementation, including the Knapsack Knapsack algorithm and improved algorithm. Reference books: " Algorithm Design and Analysis."
package
- 经典的01背包问题，采用动态规划算法，C语言编写-01 classic knapsack problem, using the dynamic programming algorithm, C language