搜索资源列表
thesis2000_fangqi
- 算法分析和设计的主要原理,动态规划 贪心算法 背包问题的实例-algorithm analysis and design of the main principle of dynamic programming greedy algorithm examples knapsack problem
0-1背包问题
- 该程序用贪心算法来求解0-1背包问题 采用贪婪准则：每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p / w largest goods Add backpack.
贪心算法背包问题
- 这个小程序，是我作为C#初学者的省份写出来，主要是练手的。主要是在算中的一种思想。环境VS2010，传于2010-10-31，地点安徽马鞍山某高校
贪心遗传算法求解背包问题
- 把贪心算法和遗传算法相结合，从而得出对NP难题的背包问题进行优化求解。
背包问题的贪心算法
- 背包问题的贪心算法
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
beibao
- 通过贪心算法实现背包问题，可实现小规模背包问题-Through the greedy algorithm knapsack problem, enabling small-scale knapsack problem
bag
- 用Visual C++编写的程序，利用贪心算法实现背包问题-Using Visual C++ to prepare the procedures for implementation the use of greedy algorithm knapsack problem
yuandaima
- 一般背包问题的贪心算法 Dijkstra算法求解单源最短路径问题 N皇后问题 Prim算法 Kruskal算法代码-The general knapsack problem greedy algorithm Dijkstra' s algorithm for single-source shortest path algorithm N Queen' s problem Kruskal Algorithm Prim code
KITBAG
- 背包问题是用贪心算法得到最优解得一个典型问题。背包问题具有最优子结构性质首先通过快速排序算法对物品按照单价从大到小排序，然后进行贪心选择。-Knapsack problem is a greedy algorithm with the optimal solution may be a typical problem. Knapsack problem with the nature of the optimal sub-structure, first of all, quick sort a
01pack
- 用动态规划，贪心算法等算法实现01背包问题-Using dynamic programming, greedy algorithm knapsack problem algorithm 01
bags
- 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
sffx
- 算法分析实验 包含背包算法，硬币问题，贪心算法-Algorithm analysis experiments including knapsack algorithm, coins, greedy algorithm
thegreedyalgorithmusinggeneticalgorithmssolveknaps
- 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem.
25142
- 贪心算法-背包问题贪 心算法-背包问题-Greedy algorithm- greedy algorithm knapsack problem- Knapsack Problem
TSPandBAGproblem
- 包里包含五个文件，其中ASforTSP是用蚂蚁算法解决TSP问题，Backtrack是用回溯法解决01背包问题，GAO是用遗传算法解决TSP，GreedySelector是用贪心算法解决01背包问题，MoneyChange是金额的数字与汉字的转换方案，本人作为一个学生初学编程，希望多多包涵。-Package contains five files, which ASforTSP ant algorithm to solve TSP is the problem, Backtrack 01 is
Greedy-Algorithm
- 数据结构（java版）第三版的贪心算法背包问题源码程序-Greedy Algorithm
贪心算法背包问题
- 一个简单贪心算法的研究，背包问题，供大家浏览参考。(A simple greedy algorithm research, knapsack problem, reference for browsing.)
背包问题
- 贪心算法解决背包问题：给定n种物品和一个背包。物品i的重量是Wi，其价值为Vi，背包的容量为C。应如何选择装入背包的物品，使得装入背包中物品的总价值最大?(The greedy algorithm solves the knapsack problem: a given n item and a backpack. The weight of the item I is Wi, its value is Vi, and the capacity of the knapsack is C. How
贪心算法-局部背包
- 使用java语言实现贪心算法中的局部背包问题，适合正在学习这方面算法的人使用。(The Java language is used to implement the local knapsack problem in the greedy algorithm, which is suitable for people who are learning this algorithm.)