搜索资源列表
dsadsa
- 贪心算法的实现：1、 最优装载实现 2、 0-1背包问题实现. -The greedy algorithm implemented: 1, the optimal load the implementation 2, knapsack problem is realized.
hybrid-genetic-algorithm--
- 用混和遗传算法求解0-1背包问题 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题-The hybrid genetic algorithm to solve knapsack problem
0-1beibaowenti(fenzhijiexiansuanfa)
- 本程序采用分支界限算法解决经典的0-1背包问题。-This program uses the branch and bound algorithm to solve the classical 0-1 knapsack problem.
0_1package
- 0-1背包问题的c语言线性规划解决方法 一种更为简单的解法-solve the o-1 package problem in c
01
- 这是我们大学里的课程设计，实现简单的0、 1背包问题，目的就是用最少的资源做做多的事情- This is our university course design, realization simple 0, 1 knapsack problem, the purpose is to use the minimal resource do more things
algorithm
- 熟悉C/C++语言的集成开发环境；通过本实验加深对分治法、贪心算法的理解。掌握贪心算法、动态规划和回溯算法的概念和基本思想，分析并掌握"0-1"背包问题的三种算法，并分析其优缺点。-Master the greedy algorithm, the dynamic programming algorithm and back of the concept and basic thought, analysis and master "0-1" knapsack problem three algo
dongtaiguihuqiubeibaowenti
- 动态规划求0/1背包问题,是一个或多个物品的重量和价值,数组中的每个元素定义一趟需要记录的数据-Dynamic programming 0/1 knapsack problem is the weight and value of one or more items, each array element defines a trip record data
0-1Package_c
- 0-1背包问题，C语言代码，txt文本，可以改编-0-1 package problem
0-1cc
- 0-1背包问题-分支限界法,算法设计课程作业-0-1 knapsack problem- branch and bound algorithm design course work
0-1hs
- 0-1背包问题-回溯法,算法设计课程作业-0-1 knapsack problem- Backtracking algorithm design course work
test
- 模拟退火算法求解0-1背包问题。模拟退火算法求解0-1背包问题-Simulated annealing algorithm for solving knapsack problem
PSO
- matlab求解粒子群，属于0-1背包问题-matlab to solve the particle swarm, belonging to the 0-1 knapsack problem
Bag
- 0-1背包问题的解答,0-1背包问题的一个简单的解答，算法不是很好，蛮力算法-0-1 knapsack problem answers to the 0-1 knapsack problem with a simple answer, the algorithm is not very good, the brute force algorithm
knapsack01_backtrack
- 数据结构中回溯法求解0-1背包问题的实现-Backtracking to the 0-1 knapsack problem in the data structure
PackageProblem
- 0-1背包问题经典解答，有界面，有具体执行算法。-0-1 knapsack problem the classic answer, interface, and the specific implementation of the algorithm.
0-1bag-queastion
- 0-1背包问题 0-1背包问题的c++实现源代码 简单实用 -0-1bag queastion
01Bags_BinaryTress
- 自己写的用二叉树处理经典的0-1背包问题的程序。-Write your own binary tree processing procedures of the classical 0-1 knapsack problem.
0-1bag
- 0—1背包问题，实现了经典背包问题.只是一个非常值得参考的算法。该算法简洁易懂，代码重用性强！-kanpsack problem which is a good algorithm for 0-1 kanosack problem!
Recursive-loop
- 是学习递归循环用法的很好的几个实例，包括经典的0-1背包问题，8皇后问题，概率问题等等，相信能帮助你更好的理解C中递归循环的实现。-Learning recursive cycle usage of several instances, including the classical 0-1 knapsack problem, the eight queens problem, probability problems, I believe it can help you understand
[itpub[1].net]ACM2000
- 解决背包问题，用各种方法解决各种问题，不断的加深对问题的熟悉程度-Solve the knapsack problem, a variety of ways to solve various problems continue to deepen familiarity