Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - knapsack

Search list

[Mathimatics-Numerical algorithms] knapsack

Description: 算法设计实验背包问题的实现visualc++实现。-Experimental realization algorithm knapsack problem
Platform: | Size: 412672 | Author: 蓉蓉 | Hits:

[Data structs] 01-knapsack-problem--

Description: 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
Platform: | Size: 778240 | Author: hudongfang | Hits:

[Data structs] Knapsack-problem

Description: 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。用2种方法实现背包问题，用C语言编写，数据结构课内试验-Knapsack problem (Knapsack problem) is NP-complete combinatorial optimization problem. Problem can be described as: Given a set of items, each item has its own weight and price, the total weight limit, we choose, to make up the total price of items. 2 methods used to achieve knapsack problem, using C language, data structure testing curricular
Platform: | Size: 1026048 | Author: linfuhong | Hits:

[Mathimatics-Numerical algorithms] ipack

Description: vc++ 算法解决背包问题 贪心算法 algorithm to solve knapsack problem greedy algorithm-vc++ algorithm to solve knapsack problem greedy algorithm
Platform: | Size: 1847296 | Author: 杨依依 | Hits:

[Algorithm] Knapsack

Description: Knapsack with dynamic programming
Platform: | Size: 1024 | Author: arekpr | Hits:

[Data structs] knapsack(five)

Description: 实现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
Platform: | Size: 14336 | Author: iwillgoon | Hits:

[Data structs] 0-1-knapsack-problem

Description: 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, corresponding to the value of P1, P2 ... ... Pn. Find the maximum value of the program. In this case, all values ​ ​ are integers
Platform: | Size: 136192 | Author: 阿四 | Hits:

[AI-NN-PR] 01-knapsack-problem

Description: 01背包问题的解决方法很多，下面用遗传算法解决01背包问题-01 knapsack problem genetic algorithm to solve
Platform: | Size: 4096 | Author: lixingze | Hits:

[AI-NN-PR] 01-knapsack-problem1

Description: 01背包问题，有很多方法可以解决，下面采用动态规划的方法。-01 knapsack problem, there are many ways to solve
Platform: | Size: 1024 | Author: lixingze | Hits:

[Data structs] 01-knapsack-problem

Description: 使用c++实现了0-1背包问题的算法，根据要求找出最佳的选项放入背包-Using c++ implementation of the 0-1 knapsack problem algorithms required to find the best option backpack
Platform: | Size: 1024 | Author: rucy | Hits:

[Data structs] Knapsack

Description: 基于0-1背包问题的A星算法，在VC++6.0上运行通过。-A Star algorithm based on 0-1 Knapsack problem ,it can run in VC++ 6.0 platform.
Platform: | Size: 3072 | Author: 乖乖虎 | Hits:

[Data structs] KNAPSACK

Description: 0-1背包问题，用动态规划做的，很不错，供大家传阅。算法设计的原型。我给具体实现了。-0-1 knapsack problem, using dynamic programming to do, very good for your circulation. Algorithm design prototype. I gave a concrete realization.
Platform: | Size: 586752 | Author: 尚启昌 | Hits:

[matlab] PSO-for-knapsack-problem

Description: pso算法在背包问题中的matlab程序。-pso algorithm in the knapsack problem in the matlab program.
Platform: | Size: 18432 | Author: hancunai | Hits:

[Data structs] Knapsack-problem1

Description: 这是一个关于背包问题的算法，其中使用了贪婪算法的思想，程序可以成功运行。-The algorithm is about the Knapsack problem，it uses a greedy algorithm, the program can be run successfully.
Platform: | Size: 1024 | Author: 小韩 | Hits:

[Data structs] Knapsack-problem2

Description: 这是一个关于背包问题的算法，其中使用了回溯的思想，程序可以成功运行。-The algorithm is about the Knapsack problem，it uses Backtracking algorithm , the program can be run successfully.
Platform: | Size: 1024 | Author: 小韩 | Hits:

[JSP/Java] knapsack

Description: knapsack，用回溯法背包问题，可直接在eclipse上运行。标题不小心写错了-knapsack, knapsack problem with backtracking, can be directly run in eclipse.
Platform: | Size: 7168 | Author: 康靖林 | Hits:

[Data structs] Knapsack

Description: 《算法设计与分析》Knapsack算法实现-the resource code of Knapsack
Platform: | Size: 31744 | Author: 王小丫 | Hits:

[Data structs] KnapSack

Description: 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
Platform: | Size: 2048 | Author: WangXiaolei | Hits:

[JSP/Java] knapsack

Description: Knapsack implementation
Platform: | Size: 1024 | Author: Meera | Hits:

[JSP/Java] Knapsack

Description: 包含3个文件，背包问题，旅行商问题，最优BST，都是java编写的。-File have three parts .They are bag problem,knapsack problem and OptimalBST.
Platform: | Size: 3072 | Author: liwei | Hits:
« 1 2 ... 5 6 7 8 9 1011 12 13 14 15 ... 50 »

CodeBus www.codebus.net