搜索资源列表
Knapsack-problem-with-GA
- solving knapsack 0,1 problem with GA in matlab
knapsack
- Knapsack problem is a classic dynamic programming model. It is both simple image easier to understand, and to some extent to peel And the nature of the dynamic programming, so many textbooks used it as a dynamic programming part, the first samp
optimal-for-knapsack-probelm
- 背包问题的多项式优化算法，实现了对目前用到的背包问题的算法的改进-an optimal algorithms for knapsack probelm
knapsack
- 01背包问题的matlab的实现，方便大家下载学习。-01 knapsack problem matlab realize, convenient download learning.
Knapsack-problem(DP)
- 本文档详细分析了动态规划的经典模型-背包问题，能够有效强化对该类型算法的理解。-This document is a detailed analysis of the classic model of the dynamic programming- knapsack problem, can effectively enhance the understanding of this type of algorithm.
0-1-knapsack-problem-matlab
- 关于matlab解决0-1背包问题的修改，原先下载的matlab代码中有错误-Solve 0-1 knapsack problem matlab modifications, there is an error in the original download matlab code
knapsack
- knapsack问题，用LocalSolver求解，可以免费试用于学习。-knapsack for learning freely with LocalSolver a slover with LocalSolver corporation.
QEA-solving-0-1-Knapsack-problem
- 主要是利用QEA解决0-1背包问题的程序-It isuseful to solving the problem of 0-1 Knapsack using QEA
Knapsack
- 背包问题（0-1背包和完全背包）动态规划代码-Code for Knapsack Problem using Dynamic Programming
Knapsack
- Knapsack and work good i hope
Knapsack
- 0-1背包问题 此算法包含了输入界面，可以随意设置货物的数量和价值。-0-1 knapsack problem algorithm includes the input interface, the number and value of the goods can be arbitrarily set.
Knapsack-problem-based-on-GA
- 本文件含论文及源代码。论文首先介绍了基本遗传算法的基本原理、特点及其基本实现技术，接着针对背包问题，论述了遗传算法在编码表示和遗传算子（包括选择算子、交叉算子变异算子这三种算子）等方面的应用情况。并且结合背包问题实例，给出了具体的编码方法，运行参数，群体大小，最大迭代次数，以及合适的遗传算子。最后，简单说明了遗传算法在求解背包问题中的应用并对遗传算法解决背包问题的前景提出了展望。-The file containing the papers and source code. The paper
Knapsack
- The describe of Knapsack algorithm
solution-of-knapsack-problem
- 回溯法、分支限界法的原理，并能够按其原理编程实现解决0-1背包问题，以加深对回溯法、分支限界法的理解。 -Backtracking, branch and bound method principle, and can according to the principle of programming to realize solving knapsack problem, in order to deepen our understanding of the backtracking, bra
Knapsack-problem
- 数据结构的经典背包问题，C++实现版本，欢迎批评指正~-Knapsack problem for c++
knapsack
- 利用遗传算法解决0-1背包问题的c++程序代码-Genetic algorithm to solve the knapsack problem c++ program
Knapsack
- 设计一般背包问题的贪心算法，对于任意给定的一般背包问题，都能够得到最优解-Greedy algorithm design in general knapsack problem, for any given general knapsack problem, are able to obtain the optimal solution
knapsack
- 本源程序主要是实现算法中的0-1背包问题，此程序在Visual C++6.0下实现-implement the knapsack problem
Knapsack
- 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorith
ts-solve-0-1-knapsack-a-info
- 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data