搜索资源列表
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
knapback
- 背包问题的最优并行算法，毕业设计，利用分治策略-Knapsack problem of the optimal parallel algorithm, graduation design, the use of sub-rule strategy
knapsack
- Solving Knapsack Using Java and CPLEX
KnapsackProblem
- 这是用MATLAB编写的模拟退火算法求解背包问题的程序-This is prepared using MATLAB algorithm simulated annealing procedure for Knapsack Problem
knap
- this file solve 0/1 knapsack problem
Knapsack
- 0-1背包 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？
evo-knapsack
- pdf for evolutionary computing of knapsack
monituihuo_beibao
- 模拟退火算法解决背包问题，使得背包能得到最好的利用。-Simulated annealing algorithm to solve knapsack problem, the backpack can be the best possible use.
KITBAG
- 背包问题是用贪心算法得到最优解得一个典型问题。背包问题具有最优子结构性质首先通过快速排序算法对物品按照单价从大到小排序，然后进行贪心选择。-Knapsack problem is a greedy algorithm with the optimal solution may be a typical problem. Knapsack problem with the nature of the optimal sub-structure, first of all, quick sort a
backpackbranchandbound
- 这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
knapsack_win
- 多目标背包问题的源码 希望对大家有用 很经典的 从Ziztler哪里得到的-Multi-objective knapsack problems code
SA
- 这是用模拟退火算法解决0-1背包问题，下载后可直接运行，可以帮助有需要对模拟退火算法进行了解的朋友。-This is a simulated annealing algorithm to solve the 0-1 knapsack problem, after downloading, can be directly run, you can help those in need of the simulated annealing algorithm to find out about fr
knapsack
- 背包问题，每类物品个数不限，使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
KnapsackProblem
- 基本遗传算法带最优保存思想的背包问题，其中，目标值那段代码使用的是惩罚函数法，选择是概率选择，交叉是双点随机交叉，变异是概率变异-The basic genetic algorithm with elitist thinking knapsack problem, which is a target that part of the code using penalty function method, choice is the probability of selection, crosso
pso_01
- 使用二进制PSO解决0-1背包问题的MATLAB程序-The use of PSO to solve 0-1 knapsack problem
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
knapsack
- it a code for knapsack
Knapsack
- The Complete Algorithm for the Knapsack Problem via Dynamic Programming in C++.
TSP
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
Knapsack
- java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.