搜索资源列表
0-1backpack
- 01背包 动态规划 背包数量固定。01背包 动态规划 。-01 backpack dynamic programming
knapsack-problem-UC
- 0-1背包问题解决机组组合问题(给定N中物品和一个背包。物品i的重量是Wi,其价值位Vi ,背包的容量为C。问应该如何选择装入背包的物品,使得转入背包的物品的总价值为最大?? 在选择物品的时候,对每种物品i只有两种选择,即装入背包或不装入背包。不能讲物品i装入多次,也不能只装入物品的一部分。因此,该问题被称为0-1背包问题。 )-0-1 knapsack problem solving unit commitment problem (in a given N items
Blood--information
- 热血/江湖背包。人物。怪物。信息遍历.-Blood/lakes backpack. Figure. Monster. Information traversal
Backpack
- C++实现0-1背包问题,简单易懂值得下载-C++ implementation of 0-1 knapsack problem is simple to understand, it is worth the download
beibaoPSO
- 用粒子群算法解决0/1背包问题,解决在背包体积有限的情况下,如何最大化的实现有效资源分配-Solve knapsack problem with particle swarm algorithm to solve the limited volume of the backpack, how to maximize the efficient allocation of resources to achieve
bpck
- bpck.c is a low-level protocol driver for the MicroSolutions backpack parallel port IDE adapter. -bpck.c is a low-level protocol driver for the MicroSolutions backpack parallel port IDE adapter.
tlbb
- 天龙外挂,功能 喊话 走路 选怪 捡物 遍历背包 lua脚本-Denon plug, function propaganda picking up strange objects selected walking traverse backpack lua scr ipt
lab2
- 0-1背包问题:若有物品n个,每个物品的价值Value,用vi表示,每个物品的重量weight用wi表示,其中vi和wi均为非负数。设背包的总容量为W,且W为非负数。本程序可选择装入背包的物品,并使装入背包的物品总价值最大。-Value, with vi, said the weight of each item s weight by wi, where vi and wi are non-negative. The total capacity of the backpack set W,
01pack
- 用C语言实现的01背包的动态规划算法,简单易懂-Dynamic programming algorithm C language 01 backpack, easy to understand
BeiBao
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为:给定一组物品,每种物品都有自己的重量和价格,在限定的总重量内,我们如何选择,才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。相似问题经常出现在商业、组合数学,计算复杂性理论、密码学和应用数学等领域中。也可以将背包问题描述为决定性问题,即在总重量不超过W的前提下,总价值是否能达到V?它是在1978年由Merkel和Hellman提出的。-Knapsack problem (Kn
algorithm
- 常用的数学算法,包括汉诺塔,八皇后,可拆背包-The commonly used mathematical algorithm, including Hanoi, eight queen, detachable backpack
ux500_pm_domains
- bpck.c is a low-level protocol driver for the MicroSolutions backpack parallel port IDE adapter. -bpck.c is a low-level protocol driver for the MicroSolutions backpack parallel port IDE adapter.
Backtrack-MaxLoading
- 背包问题的变形,解决背包最大装载问题。希望有所帮助-backpack maxloading
01beibao
- 01背包动态规划文字源程序 算法分析与设计-01 backpack dynamic programming
ToolTip
- 在基于Unity3D游戏开发过程中,这些脚本可以实现物件的拖放功能以及显示对应物件的属性信息。其主用用于背包系统和工具提示栏的实现。希望能对Unity3D游戏开发爱好者有所帮助。-Based Unity3D game development process, these scr ipts can drag and drop objects and display the corresponding object attribute information. Its primary use for
TooltipAndDrag
- 在基于Unity3D游戏开发过程中,这些脚本可以实现物件的拖放功能以及显示对应物件的属性信息。其主用用于背包系统和工具提示栏的实现。希望能对Unity3D游戏开发爱好者有所帮助。-Based Unity3D game development process, these scr ipts can drag and drop objects and display the corresponding object attribute information. Its primary use for
DP-0-1
- 0-1背包动态规划,用动态规划来求解0-1背包的问题,Java程序来实现-0-1 backpack dynamic programming, dynamic programming to solve the 0-1 knapsack problem, Java program to achieve
0-1bag
- 给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为C。问应如何选择装入背包的物品,使得装入背包中物品的总价值最大?-Given n types of goods and a backpack. Items i weight of wi, the value of vi, knapsack capacity C. Ask how to choose the items into the backpack, so the items into the backpack of the
tan-xin-suan-fa
- C语言结构化实现贪心算法,利用贪心策略解决背包问题。现有载重为M公斤的背包和n种货物。第i种货物的重量为Wi,它的总价值为Pi,假定M、Wi、Pi均为整数。设计程序给出装货方法,使装入背包的货物总价值达到最大-Using the greedy strategy to solve knapsack problem. Existing load for M kg backpack and n kinds of goods. The kind of the weight of the goods as
Backpropagation_CGD
- backpack algorithm example by matlab