搜索资源列表
ca
- 给定一个容量的背包，指定几个不同重量的物体，选择其中一个或几个，恰好能装满背包的情况是否存在。-Given a capacity backpack, specify several objects of different weights, choose one or a few, just to the existence of the case filled with backpacks.
plecak
- backpack algorithm for thievs
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
1
- ALT+F2 人物穿墙 ALT+F3 切换背包 ALT+F4 生化加血 ALT+F5 自由飞天 ALT+F6 自杀刷分 ALT+F7 爆头准心 ALT+F8 无限暴走 ALT+F9 二倍高跳 ALT+F10 轻刀加威 ALT+Z 雷达显敌 ALT+X 天雷震震 ALT+P 狙击连发-ALT+ F2 ALT+ F3 character wall switch backpack incre
backpack
- 背包问题的简单求解，适合适合刚刚学习c的同学理解数据结构-Knapsack problem simple solution, suitable for students just learning to understand the data structure c
01-knapsack-problem
- 使用c++实现了0-1背包问题的算法，根据要求找出最佳的选项放入背包-Using c++ implementation of the 0-1 knapsack problem algorithms required to find the best option backpack
bag
- 背包问题。算法中的背包问题、是我的作业。可能仍有不足。不过能基本实现背包的基本功能-Knapsack problem. Algorithm knapsack problem, is my job. May still be inadequate. But can basically achieve the basic functions of backpack
bag
- 有关背包方面的问题，包括普通背包，复杂背包，多重背包，背包的泛化物品-For knapsack problems, including ordinary backpack, backpack complex, multi-pack, backpack generalization items
bl
- tlbb 背包遍历，易语言开发，供大家学习 发源码-tlbb backpack through, easy to language development, source code for everyone to learn hair
Greedy-algorithm
- greedy algorithm:Applications-Kruskal, Prim , Dijkstra, Backpack
0-1beibao
- 算法与分析中0/1背包问题的实现，求出最大价值及所放入的背包序号-Algorithms and Analysis 0/1 knapsack problem to achieve, find the maximum value and the serial number into the backpack
01
- 0-1背包问题，涉及到计算哪个背包加入了所选的结果中。-0-1 knapsack problem, which involves the calculation of the backpack to join the selected results.
0-1bag
- 解决了0-1背包问题，能够的出最优解；并且可以知道各个背包的号码和总重量。-To solve the 0-1 knapsack problem, to the optimal solution and can know each number and total weight of the backpack.
LV-backtrack01PACKING
- 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Given n types of items and a backpack. Item i is the weight wi, the value of vi, backpack capacity of c.
package
- 有N件物品和一个容量为V的背包。第i件物品的重量是c[i]，价值是w[i]。求解将哪些物品装入背包可使这些物品的重量总和不超过背包容量，且价值总和最大-There are N items and a capacity of V backpack. The weight of the i-th item is c [i], the value of w [i]. Which solution will allow these items into the backpack does not exc
suanfashiyan
- 十个算法小程序：二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划（多段图、0-1背包、资源分配问题）、回溯和分支限界法（子集和数问题）-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, the optimal loading, dynamic pro
pack_problem
- 根据网上的《背包九讲》写了前三个(01背包、完全背包、多重背包)的C++代码，抛砖引玉。-According to the online "backpack problem," wrote the first three (01 backpack, backpack full, multi-pack) on behalf of C Code, start a discussion.
knapsack
- 背包九讲问题，各种高效解法，值得一看，包括01背包，完全背包，多重背包，一起三种背包的混合问题-Backpack nine speak problems, all kinds of efficient solution, is worth a look Including 01 backpack, completely backpack, multiple backpack, together three backpack of the mixed problem
Backbag
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。-Knapsack problem (Knapsack problem) is a kind of combinatorial optimization problem of NP complete. Problems can be described
beibaoPSO
- 粒子群算法解决0-1背包问题，对于n个体积为aj、价值分别为cj的物品，如何将它们装入总体积为b的背包中，使得所选物品的总价值最大。-Particle swarm algorithm to solve the 0-1 knapsack problem, for n volume for aj, value for cj items, how they are loaded in the total volume of the backpack, b, making the total value