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: 1010 |
Author:手电筒 |
Hits:
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: 8915 |
Author:周易 |
Hits:
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: 用回溯解背包问题 假设有n件物品，定义一个结构体a[]来存储，结构体有两个成员weight和value(weight表示重量，value表示价值)先定义一个数组col[]表示每个物品当前状态（为1表示被选，为0表示未被选），其初值全为1，从下标为0开始遍历，当前所选物品总重和总价值分别设为tw和tv（初值均为0），背包的限重设为limit，若第i个物品满足tw+a[i].weight<=limit且col[i]==1 就将a[i].weight和value加入tw和tv，否则col[i]设为0。-Knapsack problem using backtracking solution assumption has n items, the definition of a structure a [] to store, structure, body weight and has two members value (weight, said weight, value, said value) before the definition of an array col [] mean that each and every item current status (as one said to be elected, not selected to express to 0), all of its initial value 1, from the beginning subscript 0 ergodicity, the currently selected items and the total value of gross weight, respectively, as tw and tv (early values are 0), backpack weight limit is set to limit, if paragraph i of goods to meet tw+ a [i]. weight Platform: |
Size: 180224 |
Author:STartBoy |
Hits:
Description: 0-1背包问题是一个经典的算法问题，有多种解法，这里用回溯法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved by backtracking. Platform: |
Size: 541696 |
Author:储大为 |
Hits:
Description: 背包问题 主要是应用了回溯的算法实现的 还用到了栈的思想-Knapsack problem is the application of backtracking algorithm are also thought to use a stack Platform: |
Size: 258048 |
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: 我自己用C写的一个用分支界限法实现0-1背包问题，比较简便实用，而且易懂，比回溯法有明显的优势-I have written in C, a branch and bound method 0-1 knapsack problem is relatively simple and practical, and easy to understand, there are obvious advantages than backtracking Platform: |
Size: 5120 |
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背包问题，回溯方法解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背包问题；
运用分支界限法解决0-1背包问题。
-Use greedy algorithm to solve 0-1 knapsack problem
Use backtracking to solve the 0-1 knapsack problem
Using the branch and bound method to solve the 0-1 knapsack problem. Platform: |
Size: 4096 |
Author:小白 |
Hits:
Description: 1）编程递归实现0-1背包问题并回溯求出问题的解向量（即X[N]的值）和多段图的最短路经问题的动态规划算法。
2）图的数据结构采用邻接表。
3） 要求用文件装入5个多段图数据，编写从文件到邻接表的函数。
4）验证算法的时间复杂性。
5）0-1背包问题的实验数据见实验二的背包问题数据。
-1) programming recursive implementation of the 0-1 knapsack problem and backtracking to solve the problem of the solution vector (i.e. X[N] value) and the shortest path problem of multi segment graph by the dynamic programming algorithm.
2) the data structure of the graph uses the adjacency list.
3) the requirement to load the file into 5 multi- section data, write the function the file to the adjacency list.
4) the time complexity of the algorithm is verified.
5) the experimental data of the 0-1 knapsack problem is found in the experimental data of two knapsack problem. Platform: |
Size: 12288 |
Author:陈倩 |
Hits:
Search - 0-1 knapsack problem backtracking