搜索资源列表
01bag-AGL
- 01背包问题基础代码,在各大oj上有相似题目-01 knapsack problem underlying code
knapsack_recur
- 01背包问题的蛮力递归实现,非常值得学习-01 knapsack problem brute force recursive implementation
12-01bag
- 01背包问题 问题陈述:给定n种物品和一背包,物品i的重量是wi,其价值为vi,背包的容量为C。合理选择物品装入背包,使得装入背包中物品的总价值最大。在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。 问题分析:0 1背包问题是一个子集选取问题,适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时,只要其左儿子结点是一个可行结点,搜索就进入左子树,在右子树中有可能包含最优解时才进入右子树搜索;否则将右子树
01bag
- 01 背包问题,c语言实现,计算机算法分析实习,使用的回溯法-01 knapsack problem, the C language, the computer algorithm analysis internship backtracking
01package
- 用动态规划法解决01背包问题,编译器编译通过,绝对正确。-01 knapsack problem using dynamic programming method to solve the compiler to compile through, absolutely correct.
01-backpack
- ACM算法问题:0-1背包问题。此代码用vc++b编写。-ACM algorithm problem :0-1 of the knapsack problem. Write this code vc++b.
01
- 背包问题的程序,自己编的程序,程序可运行,没有界面,在dos下使用,可以再codeblocks下运行-Knapsack problem program, the program of their series, the program can be run, there is no interface, use the dos can codeblocks run
knapsack
- 蛮力法和动态规划法解决01背包问题。输入文件"backpack.in":第一行两个整数:物品个数N,背包容量.之后N行每行两个整数,分别为物品重量和物品价值-Dynamic programming method to solve the 01 backpacks problem. The input file backpack.in,: two integers: the first line items number N, backpack capacity after two integer
0-1beibaowenti
- 01背包问题 欢迎大家下载 noj问题 算法-01 knapsack problem are welcome to download noj algorithm
01beibao
- 01背包问题的回溯算法与实现 已知一个容量为M的包和n件物品, 每件物品的重量为wi, 效益值为pi. 若将物品i装入包中, 背包可得到pi的效益值增量. 要求找到一种装入物品的方案, 在不超过包的总容量前提下, 使包获得最大效益值,-01 knapsack problem backtracking algorithm and implementation of
10_01beibao
- 使用C语言编写的01背包问题源码!可以运行 !-01 knapsack problem source code using C language!
Knapsack
- 用java实现的01背包问题的有分支限界的回溯算法,注释非常详细,是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorith
Knapsack2
- 用java实现的01背包问题的动态规划算法,注释很详细,配合《算法导论》的伪代码可以很容易看懂。-01 knapsack problem with java achieve dynamic programming algorithm, very detailed notes, with the " Introduction to Algorithms" pseudo-code can easily understand.
01package
- 集群应用,在mpi环境中采用C++解决01背包问题-the application of c++ in clusters on mpi
bagsolution
- C#实现的01背包问题,里面使用了接口,适合初学者使用-C# implementation of the 01 knapsack problem, which uses the interface, suitable for beginners to use
01backpack
- 算法设计与分析01背包优化问题实验 0-1背包问题: : 有N个物品和一个背包,其中: 物品具有重量 (w1, w2, …, wn) 和价值 (v1, v2, …, vn) 背包的最大重量承受限制为c 如何放置物品可得最高价值? 思路:动态规划 -Algorithm Design and Analysis 01 knapsack optimization experiments 0-1 knapsack problem :: with N items and a back
b
- 01背包问题——求最大值 非常的实用算法-01 knapsack problem- seek the maximum
01packet
- 01背包是在M件物品取出若干件放在空间为W的背包里,每件物品的体积为W1,W2……Wn,与之相对应的价值为P1,P2……Pn。 -01 backpack is the M items removed several pieces on the space W of a backpack, each item has a volume of W1, W2 ...... Wn, with the corresponding value of P1, P2 ...... Pn.
Knapsackproblem
- 遗传算法解决01背包问题,可以用来学习和参考,有一定的价值-Genetic algorithm to solve knapsack problem 01 can be used to study and reference, there is a certain value
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