Description: 0-1背包问题 可以提供在背包方面遇到问题的学生或者有需要的人.-0-1 knapsack problem can provide a backpack problems encountered students or those who are in need. Platform: |
Size: 1024 |
Author:马涛 |
Hits:
Description: 该程序是一个用动态规划法解决0-1背包问题的小程序，可以为学习动态规划法遇到困难的同学提供帮助-the program is a dynamic programming solution 0-1 knapsack problem of small procedures, to study the dynamic programming method difficulties encountered by students for help Platform: |
Size: 231424 |
Author:成朝夕 |
Hits:
Description: 本文通过研究动态规划原理，提出了根据该原理解决０／１背包问题的方法与算法实现，并对算法的正确性作了验证．观察程序运行结果，发现基于动态规划的算法能够得到正确的决策方案且比穷举法有效．-through research paper on dynamic programming, According to the principle of resolving the 0/1 knapsack problem with the algorithm, the algorithm was verified the correctness. Observation running findings, based on dynamic programming algorithm can be the correct decision than a program exhaustive method effective. Platform: |
Size: 10240 |
Author:汤烈 |
Hits:
Description: 0-1背包问题,采用了求最优解和求最优值,分别用递归和回代来实现.-0-1 knapsack problem using the optimal solution for the optimal value and demand, and to use recursive generation to achieve. Platform: |
Size: 7168 |
Author:林静 |
Hits:
Description: 这是一个用C++实现的0/1背包问题，它是用贪心法实现的。-This is a C++ Achieved 0/1 knapsack problem, which is achieved using greedy method. Platform: |
Size: 254976 |
Author:李眼 |
Hits:
Description: 0-1背包问题，典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! ! Platform: |
Size: 1024 |
Author:刘艺 |
Hits:
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:
Description: 这是一个关于0-1背包问题算法的编程实现，包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm Platform: |
Size: 2156544 |
Author:哈达 |
Hits:
Description: 关于matlab解决0-1背包问题的修改，原先下载的matlab代码中有错误-Solve 0-1 knapsack problem matlab modifications, there is an error in the original download matlab code Platform: |
Size: 16384 |
Author:鲍文正 |
Hits:
Description: 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data Platform: |
Size: 5421056 |
Author:cmn |
Hits:
Description: 本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorithm to solve the problem, so as to further the understanding of the principles of various algorithms, ideas and nature, deepening of the algorithm Learn to exercise their own analysis of the various algorithms and use familiar with the software underlying algorithms and programming interface. Platform: |
Size: 202752 |
Author:invest |
Hits:
Description: 利用禁忌搜索算法求解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.) Platform: |
Size: 84992 |
Author:大白pu |
Hits:
Description: 使用遗传算法解决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.) Platform: |
Size: 21504 |
Author:MR安眠 |
Hits:
Search - 0/1 knapsack problem