Search - backtracking knapsack

Search - backtracking knapsack - List

[Mathimatics-Numerical algorithms] 上大_net-0-1背包问题(回朔法) DL : 0: 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.
Date : 2008-10-13 Size : 8.71kb User : 周易
[Mathimatics-Numerical algorithms] 上大_net-0-1背包问题(回朔法) DL : 0: 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.
Date : 2026-01-02 Size : 8kb User : 周易
[Mathimatics-Numerical algorithms] thedesignofalogrithm DL : 0: 该资料介绍了8中算法用于解决一些TSP，背包问题，有分治法，回溯法，等-This document describes the algorithm used to solve some 8 TSP, knapsack problem, partakers treatment method, backtracking, etc.
Date : 2026-01-02 Size : 993kb User : malijia
[Mathimatics-Numerical algorithms] suanfashiyan DL : 0: 十个算法小程序：二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划（多段图、0-1背包、资源分配问题）、回溯和分支限界法（子集和数问题）-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, the optimal loading, dynamic programming (multi-segment Figure 0-1 backpack, resource allocation), backtracking and branch and bound method (sub-set several issues)
Date : 2026-01-02 Size : 3.32mb User : 钟英
[Mathimatics-Numerical algorithms] 0-1-knapsack-problem-solution DL : 0: 这是一个关于0-1背包问题算法的编程实现，包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm
Date : 2026-01-02 Size : 2.06mb User : 哈达
[Mathimatics-Numerical algorithms] TSPandBAGproblem DL : 0: 包里包含五个文件，其中ASforTSP是用蚂蚁算法解决TSP问题，Backtrack是用回溯法解决01背包问题，GAO是用遗传算法解决TSP，GreedySelector是用贪心算法解决01背包问题，MoneyChange是金额的数字与汉字的转换方案，本人作为一个学生初学编程，希望多多包涵。-Package contains five files, which ASforTSP ant algorithm to solve TSP is the problem, Backtrack 01 is backtracking to solve knapsack problem, GAO is to use genetic algorithm to solve TSP, GreedySelector 01 is greedy algorithm to solve knapsack problem, MoneyChange is the amount of digital with the Chinese characters conversion programs, I as a beginner programming students, I hope bear with me.
Date : 2026-01-02 Size : 10kb User : 梦幻
[Mathimatics-Numerical algorithms] knap-error DL : 0: 利用回溯法解决0-1背包问题，希望对于开始学习算法的同学有所帮助-Backtracking to solve 0-1 knapsack problem, I hope to help students start learning algorithm
Date : 2026-01-02 Size : 1kb User : wangxuejun
[Mathimatics-Numerical algorithms] 0-1bag DL : 0: 运用贪心算法解决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.
Date : 2026-01-02 Size : 4kb User : 小白