Description: 里面装有 5 个小程序，分别是：0-1背包问题、二叉树遍历、链式表的实现、迷宫路径、资源最优配置算法。每个程序都有详细的说明，是我这两个学期所做的实验的一部分。-containing five small programs, namely : 0-2-1 knapsack problem, the binary tree traversal and the chain table and that the realization of the maze path, the optimal resource allocation algorithm. Every procedure is described in detail in, I was doing it two semesters of part of the experiment. Platform: |
Size: 199680 |
Author:葛兴高 |
Hits:
Description: 该程序用贪心算法来求解0-1背包问题 采用贪婪准则：每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p/w largest goods Add backpack. Platform: |
Size: 2048 |
Author:杨晨 |
Hits:
Description: 背包问题：一． 需求分析1.本程序中，表示背包和物品的元素限定为实型，物品的多少不限（可通过改变宏选择适当的数组长度）．2.程序由用户和计算机的对话方式执行，在计算机的提示信息下由用户在键盘上输入规定的运算命令，相应的输入数据和运算结果显示在其后。3.程序执行的命令包括:1) 构造物品数组及相应的标识数组2) 对数组的当前状态求和3) 打印出所有符合要求的结果4.测试数据实型的任意数据均可,不能输入字符型数据-knapsack problem : 1. A needs analysis. This procedure, said the backpack and items elements is limited to type, the number of open-items (available through Acer change the selection of appropriate length of the array). 2. Procedures by the user and computer dialogue approach to the implementation of the computer under the message by the user at the keyboard input on the operation order, the corresponding input data and computing results in the following. 3. Procedures for the implementation of the order include : 1) Construction items array and the corresponding array logo 2) to the current status of the array summation 3) Print out to meet the requirements of all four results. Test data is the type of data can be arbitrary, can not be imported for character data Platform: |
Size: 7168 |
Author:王想 |
Hits:
Description: 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable. Platform: |
Size: 3072 |
Author:唐海浪 |
Hits:
Description: 运用贪婪算法能够很好解决0/1背包问题，这是我编的一个小程序，运行过很好。-greedy algorithm can be used to solve a very good 0/1 knapsack problem, this is my part of a small program running very good. Platform: |
Size: 1024 |
Author:应吉平 |
Hits:
Description: 本例编程实现背包问题的递归和非递归算法，让你彻底了解这种算法-the cases Programming knapsack problem of recursive and non- recursive algorithm, so you thoroughly understand this algorithm Platform: |
Size: 13312 |
Author:朱南辉 |
Hits:
Description: 背包问题是组合优化领域内经典的NP完备间题,本文介绍了pso解决0/1背包问题上的一个方法-Knapsack problem is the field of combinatorial optimization of NP complete classic inter-title, this article introduced the PSO to solve 0/1 knapsack problem on one of the ways Platform: |
Size: 210944 |
Author:sky |
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: 背包问题（Knapsack Problem）的解法源代码，修改参数即可使用-Knapsack Problem source code, modify the parameters can be used Platform: |
Size: 6144 |
Author:aa |
Hits:
Search - knapsack problem