搜索资源列表
TSPTravelingsalesmanproblem
- 完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序拟退火算法解0-1背包问题MATLAB源代码 -complete graph Hamilton Circle genetic simulated annealing Matlab to be definitive source solution annealing 0- a knapsack problem MATLAB source code
017387-01
- 论坛代码 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪-Forum with the branch code boundaries to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem
OI
- 用多种算法解决0-1背包问题,包括回朔法,动态规划,贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
beibaowenti
- 这是一个用回溯算法解0--1背包问题的C++程序(好用的)-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)
0-1bag
- 在c++环境下运行的程序 利用动态规划的算法思想解决0—1背包问题-In c++ Environment running the algorithm using dynamic programming ideas to solve 0-1 knapsack problem
Fractional_Knapsack
- 谈心算法实现0/1背包问题的解决,想学习谈心算法的可以参考-Talk Algorithm 0/1 knapsack problem, want to learn to talk algorithm can refer to
0-1
- 掌握回溯法的应用 用回溯法求解0-1背包问题。 -Backtracking to master the application of retrospective method with 0-1 knapsack problem.
01beibao
- 0-1背包问题,用VC++实现,是算法设计中比较重要的问题-0-1 knapsack problem, using VC++ Realize is that algorithm design more important issue
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
0-1
- 在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高。-At 0/1 knapsack problem, there is a need for a capacity of c to load the backpack. N items from a selected i
39975737MATLAB_gatool
- 解决0-1背包问题的遗传算法matlab程序,欢迎交流提高。-Solve the 0-1 knapsack problem genetic algorithm matlab program, welcomed the exchange increased.
0-1-knapsack-problem-solution
- 这是一个关于0-1背包问题算法的编程实现,包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm
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
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
c1
- 动态规划解决背包问题 列出所有可能情况并进行求值 适用于较小数据测试(Dynamic programming to solve knapsack problem)
背包问题
- 算法效果较为良好,实现背包问题价值最大,采用遗传算法实现的比较不错的结果(The algorithm effect is good, the maximum value of the knapsack problem, genetic algorithm is used to achieve good results)
贪心算法背包问题
- 一个简单贪心算法的研究,背包问题,供大家浏览参考。(A simple greedy algorithm research, knapsack problem, reference for browsing.)
背包
- 给定n种物品和一背包。物品i的重量是wi,体积是bi,其价值为vi,背包的容量为c,容积为d。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大?在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或者不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。试设计一个解此问题的动态规划算法,并分析算法的计算复杂性。(Given n items and a knapsack. The weight of the
AOC_limit
- 使用matlab实现的蚁群算法,解决0 1背包问题为例解决组合优化问题(ant colony optimization (ACO) implement by matlab, use to solve 0/1 bagging problem)
背包问题
- 贪心算法解决背包问题:给定n种物品和一个背包。物品i的重量是Wi,其价值为Vi,背包的容量为C。应如何选择装入背包的物品,使得装入背包中物品的总价值最大?(The greedy algorithm solves the knapsack problem: a given n item and a backpack. The weight of the item I is Wi, its value is Vi, and the capa