搜索资源列表
01
- 动态规划算法之0-1背包问题算法的实现。-Dynamic programming algorithm of 0-1 knapsack problem algorithm.
0-1-back-pag-problem
- 背包问题 主要是应用了回溯的算法实现的 还用到了栈的思想-Knapsack problem is the application of backtracking algorithm are also thought to use a stack
dd
- 分支限界法。这是一个“0 - 1 背包问题的分枝－限界算法”。文件压缩没有密码。-Branch and bound
Genetic_Algorithm_0_1knapProblem
- 0-1背包问题是个NP难问题，本程序基于遗传算法，求解0——1背包问题。-Solve 0_1 knap problem with genetic algorithm
invst2
- 用matlab实现投资问题（类似于0-1背包问题，但更复杂）的动态规划-Problem with matlab realized investment (like the 0-1 knapsack problem, but more complex) dynamic programming
01bag
- 实现经典0-1背包问题，采用动态规划、分枝限界、回溯法、贪心算法等四个算法分别实现0-1背包问题，并有一个四合一的算法统一用四种方法实现。并对其时间复杂度进行了分析。-To achieve the classic 0-1 knapsack problem, dynamic programming, branch and bound, backtracking, greedy algorithm to achieve the four algorithms are 0-1 knapsack pro
bag
- 介绍了0-1背包问题的求解，并用贪心算法解决了背包问题-Introduced to solve 0-1 knapsack problem and solved with the greedy algorithm knapsack problem
ANT-TX
- 用蚁群算法和贪心算法解决0/1背包问题。可用于不同算法的比较。-Solving 0/1 Knapsack Problem by ant colony algorithm and greed method.Can be used to compare two algorithms.
beibao
- 用动态规划的方法解0/1背包问题。用VC6编译运行正确。供参考-Using dynamic programming for solving 0/1 knapsack problem. Compile and run correctly with VC6. Reference
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
01bag
- 0-1背包问题，采用了动态规划的算法，输入物品的重量和价值，以及背包的容量，计算出最优解-0-1 knapsack problem, using a dynamic programming algorithm ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ~~~~~
huoxiang
- 0/1背包问题的k阶优化算法，k=0,1,2.-0/1 knapsack problem of k-order optimization algorithm, k = 0,1,2.
algorithm_report
- 算法分析与设计报告，用java编写的4个常见的算法小程序。包括矩阵相乘问题，0/1背包问题，删数问题，和旅行商问题。-Algorithm analysis and design reports using java prepared four common algorithm applet. Including matrix multiplication problem, 0/1 knapsack problem, delete a few problems, and traveling sal
01-knapsack-problem
- 使用c++实现了0-1背包问题的算法，根据要求找出最佳的选项放入背包-Using c++ implementation of the 0-1 knapsack problem algorithms required to find the best option backpack
Knapsack
- 基于0-1背包问题的A星算法，在VC++6.0上运行通过。-A Star algorithm based on 0-1 Knapsack problem ,it can run in VC++ 6.0 platform.
01pakage
- 0-1背包问题源代码 用于算法设计的，数据结构的必要问题-0-1 knapsack problem of the source code for the algorithm design, data structures necessary to issue
Ant
- 用蚁群算法解决0-1背包问题。 用蚁群算法解决0-1背包问题。-Using ant colony algorithm to solve 0-1 knapsack problem.
Ant
- 用蚁群算法解决0-1背包问题。 -Using ant colony algorithm to solve 0-1 knapsack problem.
07
- 用堆栈实现0-1背包问题，以此了解递归实现的栈本质-0-1 knapsack problem with the stack implementation, in order to understand the recursive nature of stacks
BagZeroOne
- 用java实现0/1背包问题 贪心算法-the knapsack of using java