当前位置：
首页 资源下载
搜索资源 - 0-1 knapsack problem
搜索资源列表
-
0下载：
0-1背包问题算法在java语言的实现程序-0-1 knapsack problem algorithm java language in the realization process
-
-
0下载：
回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
-
-
0下载：
这是一个0/1背包问题的解决，有图形界面，是一次软件实习作业
-This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
-
-
0下载：
0-1背包问题的贪心算法
希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
-
-
0下载：
模拟退火解决0-1背包问题，初学者可以借鉴-Simulated annealing to solve 0-1 knapsack problem, beginners can learn from
-
-
0下载：
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.
-
-
0下载：
0/1背包问题：给定n种物品和一个容量为C的背包，物品i的重量是wi，其价值为vi，0/1背包问题是如何选择装入背包的物品（物品不可分割），使得装入背包中物品的总价值最大?回溯法解决0/1背包问题-0/1 knapsack problem: given n types of items and a knapsack of capacity C, the weight of item i is wi, the value of vi, 0/1 knapsack problem is how to
-
-
0下载：
0-1背包问题，典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
-
-
0下载：
实现0—1背包问题的分支限界搜索，为控制台应用程序，编译环境为vs2008-0-1 knapsack problem to achieve the branch and bound search for the console application, compile environment for vs2008
-
-
0下载：
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
-
-
0下载：
这是一个关于0-1背包问题算法的编程实现，包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm
-
-
0下载：
关于matlab解决0-1背包问题的修改，原先下载的matlab代码中有错误-Solve 0-1 knapsack problem matlab modifications, there is an error in the original download matlab code
-
-
0下载：
主要是利用QEA解决0-1背包问题的程序-It isuseful to solving the problem of 0-1 Knapsack using QEA
-
-
1下载：
用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data
-
-
0下载：
本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorit
-
-
0下载：
算法分析与设计（王晓东版）的0-1背包问题的改进算法的java代码实现，实现背包问题的求解-Algorithm analysis and design (Wang Xiaodong version) algorithm to improve the 0-1 knapsack problem is java code
-
-
0下载：
用C++工具，使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
-
-
0下载：
利用动态规划实现0-1背包问题，文件包含源代码，解释说明及测试样例(Dynamic programming to achieve 0-1 knapsack problem.)
-
-
6下载：
利用禁忌搜索算法求解0-1背包问题。禁忌搜索算法相比其他搜索算法更优，设置藐视规则来避免陷入局部最优解。(Solve 0-1 Knapsack Problem based on Tabu search. The tabu search algorithm is superior to other search algorithms and sets contempt rules to avoid falling into local optimal solutions.)
-
-
3下载：
使用遗传算法解决0-1背包问题，调试成功，非常适合初学者了解遗传算法和0-1背包问题(Using genetic algorithm to solve 0-1 knapsack problem, debugging is successful. It is very suitable for beginners to understand genetic algorithm and 0-1 knapsack problem.)
-
« 12
3
4
5
6
7
8
9
10
...
19
»
