搜索资源列表
GQA.rar
- 遗传量子算法求解背包问题Matlab源码,Quantum Genetic Algorithm for Knapsack Problem
01back
- 01背包问题算法源码，方便大家学习不同算法-01 knapsack problem algorithm source code, to facilitate them to learn from different algorithms
beibao
- 背包问题，可以解决最短路径问题，或优化问题-Knapsack problem, the shortest path problem can be solved, or optimization problems
Algorithms
- 算法导论上机作业java实现，主要有背包问题，八皇后问题，递归等。-Introduction to the machine operation algorithm java to achieve, there are knapsack problem, the eight queen problem, recursive and so on.
pacel
- 经典问题----背包问题的java源代码，求解-Knapsack problem---- the classic problem of the java source code, to solve
SimulatedAnnealingAlgorithm
- matlab编制的用模拟退火算法解决0-1背包问题的具体实例-matlab prepared using simulated annealing algorithm to solve 0-1 knapsack problem specific examples of
beibao
- 通过贪心算法实现背包问题，可实现小规模背包问题-Through the greedy algorithm knapsack problem, enabling small-scale knapsack problem
package
- 动态规划的背包问题，包括讲解，源代码还有详细的例证。-Dynamic programming knapsack problem, including explanations, there is a detailed source code examples.
TSP
- 解决背包问题 自动求解最大价值 利益最大化问题-Automatically solve the Knapsack Problem to maximize the interests of maximizing the value of solving the problem
knapsack
- 背包问题，每类物品个数不限，使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
01pack
- 用动态规划，贪心算法等算法实现01背包问题-Using dynamic programming, greedy algorithm knapsack problem algorithm 01
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
beibaowenti
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
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