搜索资源列表
贪心方法
- 贪心方法解0/1背包问题,构造一个物品类,调用类方法对背包进行排序,核心代码已给出-greedy method for 0 / 1 knapsack problem, a structural categories of goods, the category called right backpack method for sequencing, the core code has been given
my0-1knapsack
- 给定n 个物品, 物品i重为wi 并且价值为 vi ,背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W . 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot
algrithm
- 算法设计与分析的经典程序,主要有0-1背包问题,最小生成树等。-algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
fjdjf
- 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪.-branch line with the law to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal handling operations Q premises
tigongyuanma
- 该文件包共有5个文件 TSP--传统算法---说明TSP的传统算法实践 背包问题----0-1背包问题的传统算法实践 模拟退火算法----模拟退火算法实现TSP问题 我的通讯录----我整理写的个人通讯录 遗传算法----遗传算法解决TSP问题
dfs0-1
- dfs回溯方法解决0-1背包问题。 对比dp减小了空间复杂度-dfs 0- 1
GA0-1
- 0-1背包问题遗传算法,包含精英选择和非精英选择-0-1 knapsack problem algorithms, comprising elite and non-elite choose
0-1knapsack
- 动态规划0-1背包问题 列表法并且测试时间代价-0-1 knapsack problem dynamic programming
0-1beibaowenti
- 应用禁忌搜索算法解决0-1背包问题,可以快速得到最优结果,用matlab实现-Application of tabu search algorithm to solve 0-1 knapsack problem, you can quickly get the best results, using matlab realize
0-1knapsack-problem
- 这是一个简单的0-1背包问题,采用matlab编程,使用模拟退火算法求解,结果精确快速,并可以应用到很多其他问题-This is a simple 0-1 knapsack problem, using matlab programming, simulated annealing algorithm, accurate results quickly, and can be applied to many other problems
0-1backbag
- 北邮算法设计与分析第三章上机作业 关于0-1背包问题的具体算法-BUPT algorithm design and analysis of the third chapter on machine operation on specific algorithms 0-1 Knapsack Problem
0-1_package_problem
- 0-1背包问题:使用动态规划算法进行求解0-1背包问题-0-1 Knapsack Problem: Solve the 0-1 knapsack problem using a dynamic programming algorithm
0-1beibao
- 这是用MFC写的,开发环境是VC++。有软件界面,主要用于求解0-1背包问题,亲测无误。-This is written in MFC, and the development environment is VC++. It has software interface, mainly for solving 0-1 knapsack problem.
simulated annealing algorithm
- 模拟退火算法的应用很广泛,可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the maximum Problem Cut (Max), 0-1
c1
- 动态规划解决背包问题 列出所有可能情况并进行求值 适用于较小数据测试(Dynamic programming to solve knapsack problem)
背包问题
- python的0-1背包算法实现,包含如何求出路径,还有算法流程图(Python 0-1 knapsack algorithm implementation, including how to find the path, and the algorithm flow chart)
AOC_limit
- 使用matlab实现的蚁群算法,解决0 1背包问题为例解决组合优化问题(ant colony optimization (ACO) implement by matlab, use to solve 0/1 bagging problem)
test.py
- 通过遗传算法解决0-1背包问题,以选择办事处为背景(solve the package problem through genetic algorithm)
采用基于粒子群的多目标优化算法解决背包问题
- 多目标优化问题与粒子群算法的结合,以解决0-1背包问题(The multi-objective optimization problem is combined with particle swarm optimization to solve the 0-1 knapsack problem)
穷举法求解0-1整数规划的matlab程序
- 0-1整数规划有很广泛的应用背景,比如指派问题,背包问题等等,实际上TSP问题也是一个0-1问题,当然这些问题都是NP问题,对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的,本程序只不过是一个练习,得意之处是用递归法把所有解都排列出来。(0-1 integer programming has a very wide application background, such as assignment problem, knapsack problem and so on. In