搜索资源列表
suanfa
- 计算机算法中用到的经典算法。包括01背包,多段图,资源分配问题,子数合集等。-Computer algorithms used in the classical algorithm. Including 01 backpack, multi map, resource allocation, the number of sub-collection, etc..
beibao
- 给定物品n件,他们的重量分别是w[0],w[1],……w[n-1],物品的价值分别为v[0],v[1],……v[n-1],另有一个背包,它可以容纳的总重量为w。设计一种物品挑选方案,要求从这n件物品中所选取的物品的总重量不超过背包的容量w,使选中物品的价值之和最大。 -N pieces of a given item, the weight they were w [0], w [1], ... ... w [n-1], the value of goods, respectively v [0
lingyibeibao
- 0/1背包问题的动态规划算法,要求输出背包内物品的最大价值以及选入背包的物品种类,利用动态规划方法设计背包问题-0/1 knapsack problem of dynamic programming algorithm, the maximum output value in the backpack items and selected by the backpack, dynamic programming method to design a knapsack problem
suanfaqxf
- 算法实验报告+源代码 实验一 1题 归并排序.cpp 11 实验一 2题 快速排序.cpp 12 实验二1题 贪心法求背包问题.cpp 13 实验二2题 贪心法求最短路径.cpp 16 实验三 动态规划求最短路径.cpp 17 实验四 回溯法求背包.cpp 18-Algorithm+ source code for test lab reports a problem for a merge sort. Cpp 11 question tes
01beibaohuisufa
- 回溯法求解01背包,VC++6.0编译通过,有测试数据和算法思路-Retrospective method 01 backpack, VC++6.0 to compile, with test data and algorithms for
bag
- 《背包九讲》,学习动态规划必读,非常经典就不多说了!-" Backpack nine stresses" learning dynamic programming must-read, very classic is not to say it!
Knapsack
- 0-1背包的回溯算法,c++实现-0-1 backtracking algorithm backpack, c++ implementation. . .
a
- 0—1背包问题描述如下: 给定m种物品和一背包。物品i的重量是w[i],其价值为v[i],背包的容量是c,问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大。(每种物品只能选择放入0/1次背包)-0-1 knapsack problem described as follows: given m types of items and a backpack. Item i of the weight of w [i], a value of v [i], the capacity
backpack
- 用C#来实现遗传算法中的背包问题。其中只有变异过程。-Using C# to implement the genetic algorithm knapsack problem. Only mutation process.
backpack
- 对背包问题进行的求解,能够处理体积相同,但是不同物品的问题-The solution on the knapsack problem that can handle the same volume, but the problem of different items
beibao
- 0-1背包问题:给定n种物品和一个背包,物品i的重量是Wi,物品i价值为Vi,背包的容量为C。应如何选择装入背包的物品,使得装入背包中物品的总价值最大? 在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包为1或不装入背包为0。不能将物品i装入背包多次,也不能只装入部分的物品i。0-1背包问题的主要特点是在选择物品i装入背包时,每种物品仅有一件,可以选择放或不放-0-1 knapsack problem: Given n types of items and a backpack, th
0-1beibaowenti
- 给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为C。问:应该如何选择装入背包的物品,使得装入背包中物品的总价值最大?-Given n types of items and a backpack. Item i of the weight of wi, the value of vi, backpack capacity C. Q: How should I choose the items into the bag, making the backpack into the
beibaowenti
- 有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。-With N items and a capacity of V backpack. S i is the cost of items c [i], value w [i]. Solving the items into the bag which allows the cost of these items does not exceed t
shiyanbaogao
- 关于算法分析的几个实验,包括01背包,最优装载问题-Several experiments on the analysis of algorithms, including the 01 backpack, the optimal loading problems, etc.
1
- 利用贪心策略解决背包问题。现有载重为M公斤的背包和n种货物。第i种货物的重量为Wi,它的总价值为Pi,假定M、Wi、Pi均为整数。设计程序给出装货方法,使装入背包的货物总价值达到最大。-Greedy strategy to solve the knapsack problem using. Current load of M kg backpack and n kinds of goods. First i kind of cargo weight Wi, its total value of
Graphic-LCD-Backpack--5_11_10
- 128x64 graphical LCD code
01
- c++利用回溯法来实现01背包问题 阶段是:在前N件物品中,选取若干件物品放入背包中; 状态是:在前N件物品中,选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值; 决策是:第N件物品放或者不放; -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of items into the backpack status
SN-MADE
- 注册机 源代码 加密用的“背包”你可以任意给出,只有编者知道 加密方法为硬盘序列号与背包进行异或运算-RI source code is encrypted with the " pack" whatever you give, only the editor knows the encryption method for the hard drive serial number XORed with backpack
pakage
- 01背包问题:给定n种物品和一个背包。物品i的重量是wi,其价值为vi,背包的容量为c.问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大。-01 knapsack problem: Given n types of items and a backpack. Item i of the weight of wi, the value of vi, c. Q backpack with a capacity of how to choose the items into the bac
bag-problem
- 给定n种物品和一重量为M背包。物品i的重量是wi。问应如何选择装入背包的物品,使得装入背包中物品的总重量恰好为M,找出问题的所有解。-Given n types of items and a weight of M backpack. Item i is the weight wi. Asked how to choose the items into the bag, making the items into a backpack just for the total weight of M