搜索资源列表
beibaofenti
- 大学数据结构上机作业，C++语言写的0-1背包问题解析，练习并理解0-1背包的原理。-University of machine operation data structures, C++ language to write the 0-1 knapsack problem analysis, practice and understand the principles of the 0-1 knapsack.
GenericAlgorithm
- 该代码为遗传算法以及两个实例，背包问题和旅行商问题，每个实例均有三组数据写在代码中，运行时将不需要的数据注释掉即可。-The source is about generic algorithm, including two examples, the knapsack problem and the traveling salesman problem.
knapsackproblem
- 分别用蛮力法、回溯法解决0/1背包,visual studio开发环境-Were used brute force method, backtracking to solve the 0/1 knapsack, visual studio development environment
0-1beibao
- 算法设计与分析 0-背包问题动态规划算法源代码-Algorithm Design and Analysis 0- knapsack problem dynamic programming algorithm source code
bag
- 非常经典的0-1背包问题采用贪心算法实现-Very classical 0-1 knapsack problem using greedy algorithm
0-1bag
- 0-1背包问题：有N件物品和一个容量为V的背包。第i件物品的花费是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。-The 0-1 knapsack problem: N items and a capacity of V backpack. Take the first I items is c[i], the value is w[i]. For which goods loaded backpack can make the value of the sum of the
01beibao
- 使用VC编程工具，C语言实现动态规划算法解决01背包问题-Using the VC programming tool, C language implementation 01 knapsack problem solving dynamic programming algorithm
01knap
- 回溯法解决01背包问题-Backtracking to solve 01 knapsack problem
PACKET
- 分支界限问题中的背包算法，希望对大家有所帮助！-Knapsack algorithm of branch line questions, hope to be of help!
exp3
- 贪心法解背包问题的c语言源程序 编译通过-Greedy method solving knapsack problem
Backpack-nine-speak
- 01背包模板 多重背包模板 完全背包-01 knapsack template multiple template completely backpack
source
- home+work其实是01背包问题，二维一维都可以-home+work actually 01 knapsack problem, can be a two-dimensional one-dimensional
beibao
- 一个很好的运用模拟退火解决0-1背包问题的一个例子程序-A good use of simulated annealing to solve 0-1 knapsack problem an example program
GA_knapsack
- 使用遗传算法解决0-1背包问题，算法效率好-The use of genetic algorithm to solve 0-1 knapsack problem, a good algorithm efficiency
tanlanbeibao
- 进的背包问题：给定一个超递增序列和一个背包的容量，然后在超递增序列中选（只能选一次）或不选每一个数值，使得选中的数值的和正好等于背包的容量。 代码思路：从最大的元素开始遍历超递增序列中的每个元素，若背包还有大于或等于当前元素值的空间，则放入，然后继续判断下一个元素；若背包剩余空间小于当前元素值，则判断下一个元素-Into the knapsack problem: Given a super-increasing sequence and a capacity backpack, an
Floyed-Huffman-prim
- 算法设计与分析课程中常用的一些算法，包括Floyed算法，Huffman算法、prim算法，单源最短路径算法，分数背包问题-Algorithm Design and Analysis course some commonly used algorithms, including Floyed algorithm, Huffman algorithm, prim algorithm, single-source shortest path algorithm, fractional knapsac
huisujiexian
- 用回溯界限的方法，解决背包问题。可以有效的运行.-Boundaries with backtracking method to solve the knapsack problem. Can effectively run.
Binary-Knapsack-Problem
- Tournoment selection
0-1bag
- 假设有n件物品，每件物品有各自的重量W1,W2,……,Wn和 与之对应的价值V1,V2,……,Vn。设背包的容量为c，在不超过背包容量的前提下，求出获得最大价值总和的方案。（0-1背包的情况下物品不可分割，只能选择放入，或者不放入背包中）。 -Suppose there are n items, each item has its own weight W1, W2, ......, Wn and the corresponding value of V1, V2, ......, Vn
knapsack_algorith
- matlap source code for knapsack problem