Search - backtracking knapsack

Search - backtracking knapsack - List

[Data structs] 0-1背包的回溯算法 DL : 1: 回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
Date : 2026-01-02 Size : 249kb User : gtop
[Data structs] bbwt DL : 0: 自己随便写的大家看看最好有人帮我写个回溯算法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
Date : 2026-01-02 Size : 1kb User : 手电筒
[Data structs] c++huisu DL : 0: 背包回溯法,初来乍到如有其他问题还请各位多多指教.-knapsack backtracking, just arrived at that if other issues also invited to the exhibitions.
Date : 2026-01-02 Size : 5kb User : lee
[Data structs] beibaowenti DL : 0: 这是一个用回溯算法解0--1背包问题的C++程序（好用的）-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)
Date : 2026-01-02 Size : 1kb User : chen
[Data structs] pack DL : 0: 背包问题的回溯法,用回溯法解决背包问题,区别于其他算法 -Knapsack Problem retrospective method, with backtracking to solve knapsack problem, different from the other algorithms
Date : 2026-01-02 Size : 1kb User : 张仁春
[Data structs] Knap2 DL : 0: 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
Date : 2026-01-02 Size : 6kb User : uuhorse
[Data structs] C DL : 0: 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source
Date : 2026-01-02 Size : 15kb User : 海霞
[Data structs] 01beibao DL : 0: 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
Date : 2026-01-02 Size : 242kb User : chenchen
[Data structs] KnapsackProblem DL : 0: 0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
Date : 2026-01-02 Size : 154kb User : 王若
[Data structs] 0-1knapsack_problem DL : 0: 0/1背包问题：给定n种物品和一个容量为C的背包，物品i的重量是wi，其价值为vi，0/1背包问题是如何选择装入背包的物品（物品不可分割），使得装入背包中物品的总价值最大?回溯法解决0/1背包问题-0/1 knapsack problem: given n types of items and a knapsack of capacity C, the weight of item i is wi, the value of vi, 0/1 knapsack problem is how to choose a backpack load of goods (goods indivisible), items into the backpack making the total value of the largest? backtracking to solve 0/1 knapsack problem
Date : 2026-01-02 Size : 1kb User : 侯伟
[Data structs] recursiveBTKnapsack DL : 1: 用vc++6编写的程序，采用回溯法，解决背包问题。-Vc++6 with the preparation of the procedures, the use of backtracking to solve knapsack problem.
Date : 2026-01-02 Size : 1.05mb User : 柳春锋
[Data structs] Knapsack DL : 0: 0-1背包的回溯算法，c++实现-0-1 backtracking algorithm backpack, c++ implementation. . .
Date : 2026-01-02 Size : 882kb User : 王
[Data structs] Backtracking DL : 0: 回溯法解决背包问题。经典背包问题的回溯法C语言实现。-Backtracking to solve knapsack problem. Classical knapsack problem backtracking C language.
Date : 2026-01-02 Size : 744kb User : 靳舒馨
[Data structs] knapsack(five) DL : 0: 实现0-1背包问题的优先队列分支限界算法 FIFO 分支限界算法递归法回溯法动态规划算法-0-1 knapsack problem to achieve the priority queue FIFO branch and bound algorithms branch and bound backtracking algorithm recursion dynamic programming algorithm
Date : 2026-01-02 Size : 14kb User : iwillgoon
[Data structs] Backtracking DL : 0: 这是算法设计与分析课程实验，回溯算法实验的简单的源代码，包括回溯法背包问题，回溯符号问题。-This is the algorithm design and analysis course experiment, the experiment simple backtracking algorithm source code, including backtracking knapsack problem, the problem back symbol.
Date : 2026-01-02 Size : 1kb User : 林达
[Data structs] Knapsack-problem2 DL : 0: 这是一个关于背包问题的算法，其中使用了回溯的思想，程序可以成功运行。-The algorithm is about the Knapsack problem，it uses Backtracking algorithm , the program can be run successfully.
Date : 2026-01-02 Size : 1kb User : 小韩
[Data structs] KnapSack DL : 0: 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
Date : 2026-01-02 Size : 2kb User : WangXiaolei
[Data structs] knapsack-problem DL : 0: 原创，背包问题的四种解法，回溯法，动态规划法，以及两种蛮力法，C++代码，编译运行通过，结果正确，可以比较各种方法的效率。-The original, four solutions of the knapsack problem, backtracking, dynamic programming, and two brute force method, C++ code, compile, run through, the result is correct, you can compare the efficiency of the method.
Date : 2026-01-02 Size : 2.34mb User : ZLS
[Data structs] huisufa DL : 0: 回溯法背包问题，很实用也是经过改进的背包问题-The backtracking knapsack problem, very practical and improved knapsack problem
Date : 2026-01-02 Size : 1kb User : 吴振林
[Data structs] 0-1-Knapsack-problem DL : 0: 本次实验选择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.
Date : 2026-01-02 Size : 198kb User : invest

« 12 »