搜索资源列表
procedure
- 运用递归或非递归方法来解决0-1背包问题，更好的解决该问题。-Using recursive or recursive method to solve 0-1 knapsack problem, a better solution to the problem.
Algorithm-Introduction-Experiment
- 中科大软件学院算法导论实验源代码，包括0-1背包问题、快速排序、贪心算法等问题。-this pack of code includes 0-1 knapsack problem, quick sort, greedy algorithm and other issues
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_1bag100
- 0 1背包问题的C＋＋实现代码，比较简单，希望大家可以借鉴。-0 1 knapsack problem realize the C code is relatively simple, I hope everyone can learn from.
knapsack
- 动态规划的经典实例-0-1背包问题，体会如何巧妙消除递归，代码简洁。-Classic example-0-1 Knapsack problem dynamic programming experience how to skillfully eliminate recursion, concise code.
TSP
- 1.用模拟退火解决TSP问题 2.用遗传算法解决0/1背包问题-1. solve TSP problem using simulated annealing 2. 0/1 knapsack problem solved using genetic algorithms
firely
- 基本萤火虫算法可用于车间调度问题，旅行商问题，0-1背包问题-firely sadf fdf dsfsdfg
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-1-knapsack-problem
- 动态规划解决01背包问题,采用c语言实现-01 dynamic programming to solve the knapsack problem, with c language
Algorithm-design-and-analysis
- 大学算法课上的大作业，包含残缺棋盘游戏问题、0/1背包问题、高速缓存调度问题、旅行商问题、流水作业调度问题等等若干问题，有完整源代码、结果截屏、时间复杂性分析-University algorithm class project, including the imperfect board game, 0/1 knapsack problem, the cache scheduling problem, traveling salesman problem, line production sc
DynamicProgramming
- 0/1背包问题是学习动态规划算法最经典的例子 Java代码实现0/1背包问题 代码里有详细的注释，比较好理解-knapsack problem is one of the most classic problems to learn dynamic programming technique Java code,easiser to understand
0-1backbag
- 北邮算法设计与分析第三章上机作业 关于0-1背包问题的具体算法-BUPT algorithm design and analysis of the third chapter on machine operation on specific algorithms 0-1 Knapsack Problem
src
- ACM题目用优先队列法解决0-1背包问题c++源代码-ACM topic with priority queuing method to solve 0-1 knapsack problem c++ source code
P6-1
- 这是一个模拟退火程序，可以用于解决背包问题-This is a simulated annealing procedures can be used to solve the 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
liangziyichuan
- 量子遗传算法解决0-1背包问题的MATLAB代码，亲测好用-Quantum genetic algorithm to solve 0-1 knapsack problem MATLAB code, useful pro-test
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.
qremc
- 该程序用贪心算法来求解0-1背包问题 采用贪婪准则-The program using a greedy algorithm to solve 0-1 knapsack problems By means of the criterion of greed
GA_backpack
- 用MATLAB实现遗传算法解决0-1背包问题。 赌轮选择，单点交叉，变异(GA_MATLAB about 0-1knapsack problem roulette wheel selection; single-point crossover; variation;)
WLVXCB
- 这是一个0 1背包问题的解决,有图形界面,是一次软件实习作业()