搜索资源列表
huisufa0-1
- 算法分析-回溯法，0-1背包问题，按选优条件向前搜索，以达到目标。-Algorithm- Backtracking，0-1Knapsack problem，Forward search, the optimal selection conditions in order to achieve the goal.
knap-error
- 利用c++语言进行01背包问题回溯法解决实际问题-knapsack problem
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.
beibao
- 用c语言编写的背包问题的算法设计，属于控制台编程-Knapsack problem using the c language algorithm design, and a console programming
beibaowenitjiejuefangga
- 01背包问题及其解法研究 背包问题及其解法研究-bag problerm slove voice
beibaowenti
- 基于mfc的可视化窗口的背包问题，简单直观-Based the mfc visualization window knapsack problem, a simple and intuitive
0_1package
- 0-1背包问题的c语言线性规划解决方法 一种更为简单的解法-solve the o-1 package problem in c
src
- 逻辑回归的jar包和示例程序，可以处理背包问题和其它的逻辑回归问题-Logistic regression jar package to deal with the knapsack problem
package01
- 动态规划解决01背包问题，简单易懂,适合初学者!-package 01 program
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-
SGA_geneknap
- 标准遗传算法背包问题，标准遗传算法，背包问题，源码注释-standard genetic algorithm ——knapsack problem
0-1-knapsack-problem-solution
- 这是一个关于0-1背包问题算法的编程实现，包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm
beibaoproblem
- 该算法主要是用贪心算法求解背包问题。背包问题应用TSP问题也非常广泛-The algorithm is the greedy algorithm for knapsack problem.
moPSO
- 基于多目标的PSO用于解决背包问题的程序，运行上比较花时间，请耐心等待。-Procedures used to solve the knapsack problem based on multi-objective PSO run more to spend time, please be patient.
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
suanfa
- 分支限界法解决01背包问题，适用于算法上机作业-Branch and bound method to solve the 01 knapsack problem
0-1Package_c
- 0-1背包问题，C语言代码，txt文本，可以改编-0-1 package problem
knackpack
- 背包问题的资料，可以用来做多数背包问题。我认为是很好的使用工具-Knapsack problem that can be used to do most of the knapsack problem. I think it is good to use tools