搜索资源列表
Knapsack
- 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
Beibao-JAVA
- 提供一个用Java实现背包问题的解法，如果有必要可以自行修改相关参数后再做仿真-Used to provide a Java implementation of the solution of knapsack problem and, if necessary modify the relevant parameters can then make simulation
knapsack
- Solving Knapsack Using Java and CPLEX
Knapsack
- 经典的背包问题用回朔法实现的JAVA代码-Knapsack problem with the classic method of retrospective JAVA code
Java
- 一些很经典的算法！！！包括八皇后问题和背包问题，排列组合问题和数字拆分问题等.-Algorithm for some very classic! ! ! Including the eight queens problem and the knapsack problem, permutation and combination problems and digital split issues.
Knapsack
- java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
knapsack
- 背包问题算法 - 贪心法，递归法和动态规划法分别解决-Three solutions to Knapsack problem: the integer knapsack problem solution, fractional knapsack solution and DDG solution
Bag
- jcreator下写的背包问题，适合JAVA入门。给定背包的容量，在输入的物品中，求出符合条件的解，如果不存在解，则输出不存在-jcreator written under the knapsack problem, for JAVA entry. Given knapsack capacity, in input items, find qualified solution, if there is no solution, the output does not exist
java
- 老师给的用Java编写的算法，包括背包问题， 回溯法等等，适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning.
knapsack-code-with-java
- knapsack with java scr ipt
Knapsack
- 0/1背包问题，java差分进化算法实验-0/1 knapsack problem, java experimental differential evolution algorithm
Knapsack
- 包含3个文件，背包问题，旅行商问题，最优BST，都是java编写的。-File have three parts .They are bag problem,knapsack problem and OptimalBST.
Knapsack
- 用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 algorith
Knapsack
- 使用Java编程，采用回溯算法来解决0-1背包问题。-Using the Java programming using backtracking algorithm to solve 0-1 knapsack problem.
0-1-knapsack-problem--
- 算法分析与设计（王晓东版）的0-1背包问题的改进算法的java代码实现，实现背包问题的求解-Algorithm analysis and design (Wang Xiaodong version) algorithm to improve the 0-1 knapsack problem is java code
Knapsack
- 很经典的01背包以及分数背包问题的解决方案，分别用了动态规划以及递归的思想！-01Knapsack and fractional Knapsack in java
OwnTest
- 通过Java编码实现标准遗传算法（SGA）解决背包问题(Through Java coding, the standard genetic algorithm (SGA) is implemented to solve knapsack problem)
12.8 01背包练习题
- java 动态规划之0-1背包问题代码详解，详细注释(0-1 knapsack problem dynamic programming code Xiangjie)
回溯法（01背包问题）
- 回溯法解决01背包问题，111111111111111111(Backtracking method for solving 01 knapsack problems)
MyDPUtils
- 各类背包问题算法的java实现，并且带有部分注释(Knapsack problem algorithm java implementation, and with some notes)