Description: 用遗传算法解0/1背包问题，背包问题是著名的NP完备类困难问题，此处给出解法。-Genetic Algorithm for 0/1 knapsack problem, knapsack problem is a well-known class of NP-complete problems. Solution is here. Platform: |
Size: 2048 |
Author:李博宁 |
Hits:
Description: 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。-Genetic Algorithm for Knapsack Problem 01 experimental report references. If you read this procedure should not understand the genetic algorithm or clever, then it is better not to look at this issue. Platform: |
Size: 201728 |
Author:gouyabin |
Hits:
Description: 贪心算法求背包问题,分别求出了三种标准1. 按效益值由大到小取物品. 2. 按重量值由小到大取物品
3.按比值pi/wi的值由大到小取物品
其中第3种是最优解-Greedy algorithm for knapsack problem, respectively, obtained three standard 1. Press-effective value of descending and remove things. 2. By weight the value of items taken from small to big 3. According to the ratio of pi/wi check the value of descending The first of these three kinds of goods is the optimal solution Platform: |
Size: 1024 |
Author:Allan |
Hits:
Description: 背包问题分枝界限算法的源代码 其中包括背包容量、下限、剩余容量、当前价值之和
等-Branch-and-bound algorithm for knapsack problem of the source code including backpack capacity, the lower limit, the remaining capacity, the current value and so on Platform: |
Size: 2048 |
Author:李辉 |
Hits:
Description: 遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。-Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process. Platform: |
Size: 504832 |
Author:竹子的信仰 |
Hits:
Description: 为了方便大家更好的学习算法分析，我上传了一个背包问题的算法-In order to facilitate a better learning algorithm all analysis, I uploaded an algorithm for knapsack problem Platform: |
Size: 1024 |
Author:feifei981110 |
Hits:
Description: 编程实现背包问题的动态规划算法。
输入要求：
第一行：物体个数Ｎ 背包载重量Ｍ （Ｎ，Ｍ≥１）
第ｉ行：第i-1个物体的重量 价值（ｉ＝２,3,…,N+1）-Programming the dynamic programming algorithm for knapsack problem. Input requirements: first line: the number of objects N backpack load of M (N, M ≥ 1) the first i-line: the first i-1 the value of the weight of objects (i = 2,3, ..., N+1) Platform: |
Size: 581632 |
Author:黄飞 |
Hits:
Description: 0-1背包问题是一个经典的算法问题，有多种解法，这里用分支定界法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method. Platform: |
Size: 727040 |
Author:储大为 |
Hits:
Description: 01背包问题的简单算法，使用语言C语言，运行环境为VC-01 A simple algorithm for knapsack problem, using the language C language Platform: |
Size: 183296 |
Author:qq |
Hits:
Description: 1.分支界限算法背包问题 2.算法之分支限界法的旅行售货员问题-1. Branch and bound algorithm for knapsack problem 2. Branch and bound algorithm for the traveling salesman problem Platform: |
Size: 498688 |
Author:acidsaber |
Hits:
Search - algorithm for knapsack