搜索资源列表
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
0-1Knapsack.problem
- Knapsack problemnew01背包问题（动态规划） 01背包实验报告-Knapsack problemnew01 knapsack problem (dynamic programming) 01 backpack Experimental Report
zero_one_question
- 算法中的经典问题：0——1 背包问题 在该程序中运用了动态规划算法成功解决了0——1背包问题-Classic problem of algorithm 0- 1 knapsack problem in the process use of dynamic programming algorithms succeeded in solving 0- 1 Knapsack Problem
LinerArange
- 动态规划方法视线特殊的（0，1，2）背包问题，获得最佳的物品取舍方案-Dynamic programming special attention (0,1,2) knapsack problem, obtain the best trade-off program items
Fac3_9
- //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm
KnapsackProblem
- 0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
knapsack
- 背包问题，每类物品个数不限，使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
knapsack
- MFC写的用动态规划法解决0-1背包问题。-solve 0-1 knapsack problem using dynamic programming.
dynamic
- 动态规划算法的一些归纳和应用，方便各位学习用，有背包问题，最长公共字串问题，等。-Some of induction dynamic programming algorithm and applications, ease of learning to use, there are knapsack problem, the longest string of public issues, and so on.
dynamic
- 算法，用c++实现动态规划算法的背包问题（在VS2008平台上）-Algorithm, using c++ dynamic programming algorithm for knapsack problem (in VS2008 platform)
dynamic
- 动态规划法解决经典背包问题，C语言实现。-Classic dynamic programming method to solve the knapsack problem, C language.
01knapsack
- 01背包动态规划法的cpp文件 直接可用-01 knapsack dynamic programming
Dynamic
- 使用动态规划解决背包问题，用C++语言实现-Knapsack problem using dynamic programming to solve, using C++ language
knapsack(five)
- 实现0-1背包问题的优先队列分支限界算法 FIFO 分支限界算法 递归法 回溯法 动态规划算法-0-1 knapsack problem to achieve the priority queue FIFO branch and bound algorithms branch and bound backtracking algorithm recursion dynamic programming algorithm
Dynamic-Programming
- 这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，DP背包问题-This is a test algorithm design and analysis programs, dynamic programming source code. Rising sequence containing the longest, longest common subsequence, maximum field and problems, DP knapsac
Dynamic-Program
- 动态规划的问题，有基础类的背包问题，邮局问题等，里面也有该类问题的源码-Dynamic programming problem, the knapsack problem with class-based, post offices and so on, which is also the source of such problems
KNAPSACK
- 0-1背包问题，用动态规划做的，很不错，供大家传阅。算法设计的原型。我给具体实现了。-0-1 knapsack problem, using dynamic programming to do, very good for your circulation. Algorithm design prototype. I gave a concrete realization.
dynamic-programming
- 使用c++语言，在vs2008平台上编写，用动态规划法求解0，1背包问题-C++ language use, in vs2008 platform to write, with the dynamic planning solution 0, 1 knapsack problem
01-knapsack-algorithm
- 01背包动态规划算法,实现01背包算法的一个简单例子-01 knapsack dynamic programming algorithm to achieve 01 knapsack algorithm is a simple example