Location:
Search - backpack
Search list
Description: 背包问题(非0/1)C++标准算法-knapsack problem (0/1) C Standard Algorithm
Platform: |
Size: 873472 |
Author: 殷铭 |
Hits:
Description: 给定Ｎ种物体和一个背包．解决应如何选择装入背包的物品，使的装入背包的物品价值最大．-given N types of objects and a backpack. Address how to choose the items loaded backpack, the backpack loaded greatest value of goods.
Platform: |
Size: 1024 |
Author: solid |
Hits:
Description: 解决背包的取舍问题，问选择多少个不超过背包的重量的物品．能使价值最大．-solve knapsack choice question about the choice of the number does not exceed the weight of the backpack items. Make the greatest value.
Platform: |
Size: 1024 |
Author: solid |
Hits:
Description: 分支限界背包算法实现，用VC++6.0开发。-Branch and bound algorithm backpack with VC++ 6.0 development.
Platform: |
Size: 270336 |
Author: ZhaiYT |
Hits:
Description: 模拟退火算法解决背包问题，使得背包能得到最好的利用。-Simulated annealing algorithm to solve knapsack problem, the backpack can be the best possible use.
Platform: |
Size: 2048 |
Author: 张苹 |
Hits:
Description: 已知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 than the weight and M, such a situation, what kind of loaded goods into the backpack to get the most value?
Platform: |
Size: 7168 |
Author: 沈清 |
Hits:
Description: 背包问题,解决多少重量至少需要多少包的问题；-how to do about backpack,this question is very smart.
Platform: |
Size: 1024 |
Author: 周金杰 |
Hits:
Description: 不过下面程序中的背包函数采用了贪婪算法的另一种写法（背包函数是以前的代码，用来比较两种算法）-backpack problem algorithm using Greedy in C
Platform: |
Size: 1024 |
Author: tangliang |
Hits:
Description: 需对容量为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, the total weight of the items in the backpack can not exceed the capacity of the backpack, the best load is the highest value of goods loaded
Platform: |
Size: 1024 |
Author: 王康 |
Hits:
Description: 本文档涉及01背包，快速排序，归并排序，单源点最短路径等算法-This document covers 01 backpack, quick sort, merge sort, single-source shortest path algorithm
Platform: |
Size: 2048 |
Author: mick zhang |
Hits:
Description: 最基础背包算法的实现，简单明了，适合初学者看下，有帮助的-The most basic backpack algorithm implementation is simple, suitable for beginners to look helpful
Platform: |
Size: 1105920 |
Author: 郝乾 |
Hits:
Description: 分数背包的实现，在基础背包的前提下，增加分数属性，实现背包问题-The realization of the score backpack to increase the score property, under the premise of basic backpack, knapsack problem
Platform: |
Size: 334848 |
Author: 郝乾 |
Hits:
Description: Backpack Genetic Algorithm for knapsack problem
Platform: |
Size: 3072 |
Author: |
Hits:
Description: 01背包模板 多重背包模板 完全背包-01 knapsack template multiple template completely backpack
Platform: |
Size: 40960 |
Author: 陈杰 |
Hits:
Description: Backpack Genetic Algorithm Beta Version
Platform: |
Size: 4096 |
Author: poch14 |
Hits:
Description: Backpack Genetic Algorithm
Platform: |
Size: 36864 |
Author: sahand |
Hits:
Description: 本代码提供0-1背包问题的动态规划解法，适用于背包容量是整数类型-The code provides 0-1 knapsack problem dynamic programming solution for the backpack capacity is an integer type
Platform: |
Size: 1024 |
Author: xiaoran |
Hits:
Description: 假设有一个能装入总体体积为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 backpack, even if w1+w2+...+wn=T, asked to find all solutions to satisfy the above conditions.
Platform: |
Size: 2048 |
Author: 程瑶 |
Hits:
Description: Resolution of the problem backpack
Platform: |
Size: 1024 |
Author: marwa |
Hits:
Description: 典型背包问题,采用动态规划实现，希望有所帮助-backpack
Platform: |
Size: 3647488 |
Author: Zhou Lee |
Hits:
« 12
3
4
5
6
7
8
9
10
...
16
»