搜索资源列表
ipack
- vc++ 算法解决背包问题 贪心算法 algorithm to solve knapsack problem greedy algorithm-vc++ algorithm to solve knapsack problem greedy algorithm
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
01-knapsack-problem1
- 01背包问题，有很多方法可以解决，下面采用动态规划的方法。-01 knapsack problem, there are many ways to solve
Knapsack
- 基于0-1背包问题的A星算法，在VC++6.0上运行通过。-A Star algorithm based on 0-1 Knapsack problem ,it can run in VC++ 6.0 platform.
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.
Knapsack-problem1
- 这是一个关于背包问题的算法，其中使用了贪婪算法的思想，程序可以成功运行。-The algorithm is about the Knapsack problem，it uses a greedy algorithm, the program can be run successfully.
Knapsack-problem2
- 这是一个关于背包问题的算法，其中使用了回溯的思想，程序可以成功运行。-The algorithm is about the Knapsack problem，it uses Backtracking algorithm , the program can be run successfully.
KnapSack
- 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
Knapsack
- 包含3个文件，背包问题，旅行商问题，最优BST，都是java编写的。-File have three parts .They are bag problem,knapsack problem and OptimalBST.
knapsack
- knapsack problem solution
KNAPSACK
- 背包问题,动态规划实现了01背包和贪心算法部分背包-Knapsack problem, 01 backpack and full backpack
Knapsack-problem-with-GA
- solving knapsack 0,1 problem with GA in matlab
knapsack
- Knapsack problem is a classic dynamic programming model. It is both simple image easier to understand, and to some extent to peel And the nature of the dynamic programming, so many textbooks used it as a dynamic programming part, the first samp
dp-problem
- 这个包括了 ACM比赛中 经常会用到的动态递归算法的一些经典例题，例如背包问题，最长公共子序列等的源代码-This includes the classic example of the dynamic recursive algorithm is often used in the ACM competition, such as the knapsack problem, the longest common subsequence such as source code
knapsack
- 01背包问题的matlab的实现，方便大家下载学习。-01 knapsack problem matlab realize, convenient download learning.
QEA-solving-0-1-Knapsack-problem
- 主要是利用QEA解决0-1背包问题的程序-It isuseful to solving the problem of 0-1 Knapsack using QEA
Knapsack
- 背包问题（0-1背包和完全背包）动态规划代码-Code for Knapsack Problem using Dynamic Programming
outside-traning-bagpack-problem
- 背囊优化问题主要用于解决如何使野外训练中背囊内物品价值最大化的研究。我们引入背包问题的基本模型，具体结合两种实际情况，分别应用贪婪算法以及粒子群算法，得出了满足约束条件的满意解。-Backpack optimization problem to solve how to maximize the value of items in the backpack field training. We introduce the basic model of the knapsack problem,
Knapsack
- 0-1背包问题 此算法包含了输入界面，可以随意设置货物的数量和价值。-0-1 knapsack problem algorithm includes the input interface, the number and value of the goods can be arbitrarily set.
knapsack
- 利用遗传算法解决0-1背包问题的c++程序代码-Genetic algorithm to solve the knapsack problem c++ program