Description: 0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects. Platform: |
Size: 8192 |
Author:周易 |
Hits:
Description: 自己随便写的 大家看看 最好有人帮我写个回溯算法0-1背包问题的演示软件
-own writing any of us look at the best people to help me write a backtracking algorithm 0-1 knapsack problem of presentation software Platform: |
Size: 1024 |
Author:手电筒 |
Hits:
Description: 这是一个用回溯算法解0--1背包问题的C++程序（好用的）-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful) Platform: |
Size: 1024 |
Author:chen |
Hits:
Description: knap2
背包问题非递归，运用栈及回溯算法优化了一下，可以找到所有满足条件的解。
如果遇到什么问题，请发邮件至horsewhite32@hotmail.com,笔者将不胜感激
uuhorse-non-recursive knap2 knapsack problem, the use of stack and the backtracking algorithm to optimize the look, you can find all the solutions to meet the conditions. If any problems, please e-mail horsewhite32@hotmail.com, I would be grateful uuhorse Platform: |
Size: 6144 |
Author:uuhorse |
Hits:
Description: 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace! Platform: |
Size: 247808 |
Author:chenchen |
Hits:
Description: 背包问题 主要是应用了回溯的算法实现的 还用到了栈的思想-Knapsack problem is the application of backtracking algorithm are also thought to use a stack Platform: |
Size: 258048 |
Author:马浩原 |
Hits:
Description: 这是算法设计与分析课程实验，回溯算法实验的简单的源代码，包括回溯法背包问题，回溯符号问题。-This is the algorithm design and analysis course experiment, the experiment simple backtracking algorithm source code, including backtracking knapsack problem, the problem back symbol. Platform: |
Size: 1024 |
Author:林达 |
Hits:
Description: 这是一个关于背包问题的算法，其中使用了回溯的思想，程序可以成功运行。-The algorithm is about the Knapsack problem，it uses Backtracking algorithm , the program can be run successfully. 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: 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorithms and data structures Platform: |
Size: 2048 |
Author:xuchao |
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背包问题，回溯方法解n皇后问题，最大字段和，归并排序等算法，并全部包含人机交互过程-Algorithm design courses all the code, including the 0-1 knapsack problem, backtracking method to solve n-queens problem, the maximum field and, merge sort algorithms, and all include human-computer interaction process Platform: |
Size: 1756160 |
Author:小强 |
Hits:
Description: 0-1背包问题的回溯法求解,0-1背包是在M件物品取出若干件放在空间为W的背包里，求出获得最大价值的方案。算法设计 回溯的思想。-Backtracking 0-1 knapsack problem solving 0-1 knapsack is removed in several pieces on items M space W backpack, determined to get the maximum value of the program. Backtracking algorithm design ideas. Platform: |
Size: 2048 |
Author:田梓君 |
Hits:
Search - knapsack problem backtracking algorithm