搜索资源列表
背包公钥系统
- 一个基于背包公钥系统的能实现加密功能的小程序。-a backpack on the public key system to achieve a small encryption procedures.
贪心方法
- 贪心方法解0/1背包问题,构造一个物品类,调用类方法对背包进行排序,核心代码已给出-greedy method for 0 / 1 knapsack problem, a structural categories of goods, the category called right backpack method for sequencing, the core code has been given
my0-1knapsack
- 给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ． 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot
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 kinds of goods may be greater th
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 pi. Feasible backpack load, th
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 pick some parts just loaded bac
problem-Backpack
- Resolution of the problem backpack
backpack
- 典型背包问题,采用动态规划实现，希望有所帮助-backpack
backpack-problem
- 简单的背包问题： 有N件物品和一个容量为V的背包。第i件物品的重量是w[i]。在给定的背包容量的前提下，将哪些物品装入背包可使这些物品的重量总和不超过背包容量，且装进去的物品数量最多。-Simple knapsack problem: there are N items and a capacity of V backpack. By weight of the i-th items that w [i]. Under the premise of a given backpack capa