搜索资源列表
simulateanneal
- 一个解决0-1背包问题的模拟退火程序，希望给有需要的人帮助-A solution to the 0-1 knapsack problem simulated annealing process, hoping to help those in need
1
- 贪心算法0-1背包问题，很全面，很有用的-beibao
beibaoPSO
- 这份源代码是用粒子群算法解决0/1背包问题，可以正常运行。-The source code is the particle swarm algorithm to solve 0/1 knapsack problem, it works.
Backtrack_0-1bag
- 从文件读入数据，用回溯法实现了0-1背包最优解的问题-Read data from a file, using backtracking to achieve the optimal solution of the 0-1 knapsack problem
0-1beibao
- 0-1d背包问题实验报告 完整的程序 已经运行过的 -0-1d knapsack full lab report procedure has been run-off
1
- 0/1背包问题，C++实现，算法实现源代码，蛮力法实现源程序，-0/1 knapsack problem, C++ implementation, algorithm source code, brute force method to achieve source,
0-1
- 0-1背包问题， 给定一个载重量为m，n个物品，其重量为wi，价值为vi，1<=i<=n，要求:把物品装入背包，并使包内物品价值最大-0-1 knapsack problem, given a load for the m, n one item, the weight wi, the value of vi, 1 < = i < = n, asked: the items into backpacks, and to bag the maximum value of the
1.tar
- 用C++实现的0-1背包问题的动态规划解法程序。注释详实，可读性好。-C++ implementation with the 0-1 knapsack problem dynamic programming solution procedure. Comments detailed, readable.
39975737MATLAB_gatool
- 解决0-1背包问题的遗传算法matlab程序，欢迎交流提高。-Solve the 0-1 knapsack problem genetic algorithm matlab program, welcomed the exchange increased.
1
- 遗传算法解决0-1背包问题，动态规划算法-Genetic algorithm to solve 0-1 knapsack problem, dynamic programming algorithm
1
- 用回溯法解决0-1背包问题，用回溯法解决0-1背包问题-用回溯法解决0-1背包问题
0-1-knapsack-problem
- 01背包是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。在本例中所有数值均为整数-01 M items in the backpack is out of a number of pieces on the space W of the backpack, the size of each item as W1, W2 ... ... Wn, corresponding to the value of
packegePSO1
- 用matlab编写的一个解决0-1背包问题，其算法采用粒子群算法-use matlab software write 0-1 knapsack problem use PSO method
ACG0-1
- 蚁群求解TSP问题，和0-1背包问题，不错，运行结果可以-ACO for TSP, and the 0-1 knapsack problem, yes, the results can be
huisufa0-1
- 算法分析-回溯法，0-1背包问题，按选优条件向前搜索，以达到目标。-Algorithm- Backtracking，0-1Knapsack problem，Forward search, the optimal selection conditions in order to achieve the goal.
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 背包问题-动态规划法,算法设计课程作业-0-1 knapsack problem- dynamic programming, algorithm design course work
0-1-bag-problem
- 一种算法来解决0-1背包问题，这是非常好的-one arithmetic to solve 0-1 bag problem
0-1-beibao-
- 0。1 背包问题，带有输入说明，和程序详细解释-0.1 knapsack problem, with input instructions, and procedures explained in detail
0-1
- 0-1背包问题算法书籍代码，同大家分享！-0-1 Knapsack Problem Books in code share with you!