搜索资源列表
Knapsack
- Knapsack with dynamic programming
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
0-1-knapsack-problem
- 01背包是在M件物品取出若干件放在空间为W的背包里,每件物品的体积为W1,W2……Wn,与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。在本例中所有数值均为整数-01 M items in the backpack is out of a number of pieces on the space W of the backpack, the size of each item as W1, W2 ... ... Wn,
01-knapsack-problem
- 01背包问题的解决方法很多,下面用遗传算法解决01背包问题-01 knapsack problem genetic algorithm to solve
01-knapsack-problem1
- 01背包问题,有很多方法可以解决,下面采用动态规划的方法。-01 knapsack problem, there are many ways to solve
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.
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.
PSO-for-knapsack-problem
- pso算法在背包问题中的matlab程序。-pso algorithm in the knapsack problem in the matlab program.
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
- knapsack,用回溯法背包问题,可直接在eclipse上运行。标题不小心写错了-knapsack, knapsack problem with backtracking, can be directly run in eclipse.
Knapsack
- 《算法设计与分析》Knapsack算法实现-the resource code of Knapsack
KnapSack
- 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms(brute force, dynamic programming, backtracking, branch and bound ) to solve 0/1 knapsack problem
knapsack
- Knapsack implementation
Knapsack
- 包含3个文件,背包问题,旅行商问题,最优BST,都是java编写的。-File have three parts .They are bag problem,knapsack problem and OptimalBST.
knapsack
- knapsack solve problem dynamic algorithm
knapsack-problem
- 原创,背包问题的四种解法,回溯法,动态规划法,以及两种蛮力法,C++代码,编译运行通过,结果正确,可以比较各种方法的效率。-The original, four solutions of the knapsack problem, backtracking, dynamic programming, and two brute force method, C++ code, compile, run through, the resul
knapsack
- knapsack problem solution
0-1-knapsack-problem-solution
- 这是一个关于0-1背包问题算法的编程实现,包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm