搜索资源列表
Backpack
- 背包问题(非0/1)C++标准算法-knapsack problem (0/1) C Standard Algorithm
0-1bag
- 给定Ｎ种物体和一个背包．解决应如何选择装入背包的物品，使的装入背包的物品价值最大．-given N types of objects and a backpack. Address how to choose the items loaded backpack, the backpack loaded greatest value of goods.
0-1beibao
- 解决背包的取舍问题，问选择多少个不超过背包的重量的物品．能使价值最大．-solve knapsack choice question about the choice of the number does not exceed the weight of the backpack items. Make the greatest value.
Branch_Bound_Knap
- 分支限界背包算法实现，用VC++6.0开发。-Branch and bound algorithm backpack with VC++ 6.0 development.
monituihuo_beibao
- 模拟退火算法解决背包问题，使得背包能得到最好的利用。-Simulated annealing algorithm to solve knapsack problem, the backpack can be the best possible use.
backpack
- 已知N种物品和一个容纳重量为M的背包，每种物品均有自己的重量和效益值，假设这N种物品的重量和有可能大于M，这种情况下，选择哪种物品装入背包能获得最大效益值-Are known to have n kinds of goods and a weight capacity of M, backpacks, each item has its own weight and efficiency values, assume that n ki
backpack
- 背包问题,解决多少重量至少需要多少包的问题；-how to do about backpack,this question is very smart.
backpack-prob-algo-using-in-C
- 不过下面程序中的背包函数采用了贪婪算法的另一种写法（背包函数是以前的代码，用来比较两种算法）-backpack problem algorithm using Greedy in C
backpack
- 需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高-Required loading capacity c backpack. Loaded backpack of items selected from n items, items i weight of wi, the value of
01-backpack--quick-sort-algorithm
- 本文档涉及01背包，快速排序，归并排序，单源点最短路径等算法-This document covers 01 backpack, quick sort, merge sort, single-source shortest path algorithm
backpack
- 最基础背包算法的实现，简单明了，适合初学者看下，有帮助的-The most basic backpack algorithm implementation is simple, suitable for beginners to look helpful
Score-backpack
- 分数背包的实现，在基础背包的前提下，增加分数属性，实现背包问题-The realization of the score backpack to increase the score property, under the premise of basic backpack, knapsack problem
Backpack-Genetic-Algorithm
- Backpack Genetic Algorithm for knapsack problem
Backpack-nine-speak
- 01背包模板 多重背包模板 完全背包-01 knapsack template multiple template completely backpack
Backpack-Genetic-Algorithm-Beta-Version
- Backpack Genetic Algorithm Beta Version
Backpack-Genetic-Algorithm-
- Backpack Genetic Algorithm
0-1-backpack
- 本代码提供0-1背包问题的动态规划解法，适用于背包容量是整数类型-The code provides 0-1 knapsack problem dynamic programming solution for the backpack capacity is an integer type
Backpack
- 假设有一个能装入总体体积为T的背包和n件体积分别为w1,w2,…,wn的物品，能否从n件物品中挑若干件恰好装满背包，即使w1+w2+…+wn=T，要求找出所有满足上述条件的解。-Suppose there is a fit into the overall volume of T knapsack and N volume were W1, w2,... , WN items, whether the n items in the p
problem-Backpack
- Resolution of the problem backpack
backpack
- 典型背包问题,采用动态规划实现，希望有所帮助-backpack