搜索资源列表
beibao.rar
- 背包问题最优算法
QEAsolvePackage
- 最近两年比较流行的量子进化算法（QEA），能够求解一般的优化问题。算例是一个典型的背包问题（离散二值问题）。-The more popular the last two years the quantum evolutionary algorithm (QEA), be able to solve the general optimization problems. An example is a typical knapsack problem (discrete binary problem
BackTrack_01backpack
- 0-1背包问题是一个经典的算法问题，有多种解法，这里用回溯法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved by backtracking.
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 基于遗传算法的背包问题求解，遗传算法，背包问题。-Based on genetic algorithm to solve knapsack problem, genetic algorithms, knapsack problem.
beibaoPSO
- 这份源代码是用粒子群算法解决0/1背包问题，可以正常运行。-The source code is the particle swarm algorithm to solve 0/1 knapsack problem, it works.
jinjisousuobeibao
- 禁忌搜索求解01背包问题，VC++6.0编译通过，有运行结果显示-01 Tabu Search for solving knapsack problems, VC++6.0 to compile, run the results are
back-pack
- 用C语言来解决遗传算法的经典问题——背包问题。-Using C language to solve the classic problem of genetic algorithms- Knapsack Problem.
01
- c++利用回溯法来实现01背包问题 阶段是：在前N件物品中，选取若干件物品放入背包中； 状态是：在前N件物品中，选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值； 决策是：第N件物品放或者不放； -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of items into the backpack status
PSO-bag
- 用粒子群算法解决背包问题，能得到比较有效的结果-Particle swarm algorithm to solve knapsack problem, the results can be more effective
simknap_rec
- 简化背包算法，实用于大学生学习模拟使用，实现简单的背包问题-Simplify the knapsack algorithm, useful in the simulation students learn to use, simple knapsack problem
d66906376b80
- 遗传算法解决TSP背包问题的源代码，包涵MATLAB程序和详尽文字算法说明-Knapsack problem genetic algorithm source code for TSP, bear with MATLAB algorithms procedures and detailed text descr iption
01
- 01背包问题，利用的是动态规划的思想，不是改进的01背包算法-01 knapsack problem, the use of dynamic programming is the idea, not the 01 knapsack algorithm to improve
beibaoqiujie
- 用遗传算法计算背包问题的经典程序,word的文档里面有说明和程序。-Knapsack problem using genetic algorithm the classic program, word document which has instructions and procedures.
PSO-for-knapsack-problem
- pso算法在背包问题中的matlab程序。-pso algorithm in the knapsack problem in the matlab program.
背包问题
- python的0-1背包算法实现，包含如何求出路径，还有算法流程图(Python 0-1 knapsack algorithm implementation, including how to find the path, and the algorithm flow chart)
01beibao_fenzhijiexian
- 分治法实现01背包问题，输入为即将放入背包的物品的重量和对应价值的数组，输出为放置物品的最优方案(Realization of 01 knapsack problem by divide and conquer method)
01packeg
- 01背包问题的一种实现算法。根据需要设置Weight、Value和Capacity。(01 an algorithm for the realization of the knapsack problem. Weight, Value, and Capacity are set up as required.)
0-1
- 利用动态规划实现0-1背包问题，文件包含源代码，解释说明及测试样例(Dynamic programming to achieve 0-1 knapsack problem.)
背包九讲
- 经典DP 背包问题，九讲背包入门，适合新手或入门者学习动态规划(The classic DP knapsack problem, the introduction of knapsack, is suitable for beginners or beginners to learn dynamic programming.)