Search - backtracking knapsack

Search - backtracking knapsack - List

[JSP/Java] Back_Track DL : 0: 使用回溯法解决背包问题，人工智能课程实验课题。-The use of backtracking to solve knapsack problem, artificial intelligence courses experimental subjects.
Date : 2026-01-02 Size : 2kb User : 陈荣俊
[JSP/Java] Arithmetic DL : 0: 用JAVA完成的0-1背包算法，一共用了四种算法，包括贪心，分治，动态规划，回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
Date : 2026-01-02 Size : 16kb User : xiaoming
[JSP/Java] java DL : 0: 老师给的用Java编写的算法，包括背包问题，回溯法等等，适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning.
Date : 2026-01-02 Size : 1.21mb User : 小黑
[JSP/Java] 0_1Knasack DL : 0: 比较了求解0-1背包问题常用的几种算法，并用回溯法和分支限界法进行了Java编程实现，给出了文档及源码。-0-1 knapsack problem compared several commonly used algorithms, and use backtracking and branch and bound method of the Java programming, given the documentation and source code.
Date : 2026-01-02 Size : 208kb User : 谢斌
[JSP/Java] knapsack DL : 0: knapsack，用回溯法背包问题，可直接在eclipse上运行。标题不小心写错了-knapsack, knapsack problem with backtracking, can be directly run in eclipse.
Date : 2026-01-02 Size : 7kb User : 康靖林
[JSP/Java] solution-of-knapsack-problem DL : 0: 回溯法、分支限界法的原理，并能够按其原理编程实现解决0-1背包问题，以加深对回溯法、分支限界法的理解。 -Backtracking, branch and bound method principle, and can according to the principle of programming to realize solving knapsack problem, in order to deepen our understanding of the backtracking, branch and bound method understanding.
Date : 2026-01-02 Size : 88kb User : 丁
[JSP/Java] Knapsack DL : 0: 用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
Date : 2026-01-02 Size : 2kb User : xuchao
[JSP/Java] huisujiexian DL : 0: 用回溯界限的方法，解决背包问题。可以有效的运行.-Boundaries with backtracking method to solve the knapsack problem. Can effectively run.
Date : 2026-01-02 Size : 7kb User : boyuntian
[JSP/Java] Knapsack DL : 0: 使用Java编程，采用回溯算法来解决0-1背包问题。-Using the Java programming using backtracking algorithm to solve 0-1 knapsack problem.
Date : 2026-01-02 Size : 4kb User : shanshan
[JSP/Java] beibao DL : 0: 文件里面的代码主要是用递归算法，动态规划的算法，贪婪算法，回溯算法解决没有利润分配的背包问题。-File inside the code is mainly used recursive algorithm, dynamic programming algorithms, greedy algorithms, backtracking algorithm to solve knapsack problem is no distribution of profits.
Date : 2026-01-02 Size : 3kb User : 万羽
[JSP/Java] 01backtrack DL : 0: JAVA实现的回溯算法，用来求解0-1背包问题，代码里面有注释，逻辑清晰-JAVA implementation of the backtracking algorithm used to solve the 0-1 knapsack problem, the code inside the notes, the logic clear
Date : 2026-01-02 Size : 14kb User : vi_55
[JSP/Java] 回溯法（01背包问题） DL : 0: 回溯法解决01背包问题，111111111111111111(Backtracking method for solving 01 knapsack problems)
Date : 2026-01-02 Size : 1kb User : Destrory_All