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: 9385 |
Author:成朝夕 |
Hits:
Description: 0-1背包问题的动态规划求解算法,
0-1背包不同于背包问题-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem Platform: |
Size: 1310 |
Author:高亮 |
Hits:
Description: 高级算法中的背包问题求解，算法简便高效，主要解决动态规划0-1背包问题-senior algorithm to solve the knapsack problem, the algorithm is simple and efficient, dynamic programming solution 0-1 knapsack problem Platform: |
Size: 8192 |
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背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm Platform: |
Size: 431104 |
Author:王垂宇 |
Hits:
Description: 在c++环境下运行的程序 利用动态规划的算法思想解决0—1背包问题-In c++ Environment running the algorithm using dynamic programming ideas to solve 0-1 knapsack problem Platform: |
Size: 1024 |
Author:少帅 |
Hits:
Description: //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm Platform: |
Size: 1024 |
Author:ss |
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: 这是一个关于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: 本次实验选择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背包问题动态规划详解及C代码
动态规划是用空间换时间的一种方法的抽象。(0/1 knapsack problem dynamic programming detailed and C code
Dynamic programming is the abstraction of a method of replacing time with space.) Platform: |
Size: 13312 |
Author:zhangruliang
|
Hits:
Search - 0 1 knapsack problem dynamic programming