搜索资源列表
0-1
- 0-1背包问题算法书籍代码,同大家分享!-0-1 Knapsack Problem Books in code share with you!
SA0-1
- 模拟退火解决0—1背包问题,很好的套用模版-Simulated annealing to solve the 0-1 knapsack problem, apply the template
0-1-knapsack-problem-matlab
- 关于matlab解决0-1背包问题的修改,原先下载的matlab代码中有错误-Solve 0-1 knapsack problem matlab modifications, there is an error in the original download matlab code
QEA-solving-0-1-Knapsack-problem
- 主要是利用QEA解决0-1背包问题的程序-It isuseful to solving the problem of 0-1 Knapsack using QEA
0-1
- 用于解决0/1 背包问题动态规划详解及C代码,清晰明确,简单易学-Planning the Xiangjie and C code used to solve the 0/1 knapsack problem dynamic, clear, and easy to learn
0-1
- 我自己用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
BackpackTH(1)
- 退火算法实现0/1背包问题求解,java编写,eclipse中编写,工程文件齐全,界面清楚,运行结果正确-Annealing algorithm to achieve the 0/1 knapsack problem solving, writing java eclipse write engineering documents, clear interface, the results are correct
ts-solve-0-1-knapsack-a-info
- 用禁忌搜索解决0-1背包问题,及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data
pso0-1
- 粒子群算法解决0-1背包问题,输出最优解,适合初学者-Particle swarm algorithm to solve knapsack problem, suitable for beginners to see. . . . . . . . . . . . . . . . . . . . . . . .
0-1-Knapsack-problem
- 本次实验选择0-1背包问题作为题目,通过使用动态规划、回溯法和分支定界法等算法来求解该问题,从而进一步的了解各种算法的原理、思路及其本质,深化对算法的了解,锻炼自己对各种算法的分析和使用,熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorit
0-1
- 用动态规划思路去解答经典的0-1背包问题,已成功通过调试-Using dynamic programming ideas to answer the classic 0-1 knapsack problem, has successfully passed the debugging
the-problems-of-0-1-package
- 0-1背包问题在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高-the problems of 0-1 package
0-1-backpack
- 本代码提供0-1背包问题的动态规划解法,适用于背包容量是整数类型-The code provides 0-1 knapsack problem dynamic programming solution for the backpack capacity is an integer type
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
dfs0-1
- dfs回溯方法解决0-1背包问题。 对比dp减小了空间复杂度-dfs 0- 1
GA0-1
- 0-1背包问题遗传算法,包含精英选择和非精英选择-0-1 knapsack problem algorithms, comprising elite and non-elite choose
Backtracking-0-1
- 0-1背包问题的回溯法求解,0-1背包是在M件物品取出若干件放在空间为W的背包里,求出获得最大价值的方案。算法设计 回溯的思想。-Backtracking 0-1 knapsack problem solving 0-1 knapsack is removed in several pieces on items M space W backpack, determined to get the maximum value of the program. Backtracking algorit
0-1-package-question
- 0——1背包问题的解决,注重动态规划的使用,简单快捷,方便解决0-1规划问题的解决-the question of 0-1 package problem
beibao5
- /* 背包问题 问题定义: 有一个背包重量是T,有n件物品,重量分别是W0,W1...Wn-1 问能否从这n件物品中选择若干件放入背包中使其重量之和正好为T */(Tipcal package problem)
背包问题
- python的0-1背包算法实现,包含如何求出路径,还有算法流程图(Python 0-1 knapsack algorithm implementation, including how to find the path, and the algorithm flow chart)