搜索资源列表
backpack
- 动态规划实现0-1背包问题和贪心法实现背包问题-Dynamic programming to realize knapsack problem and greedy method to realize knapsack problem
12-01bag
- 01背包问题 问题陈述：给定n种物品和一背包，物品i的重量是wi，其价值为vi，背包的容量为C。合理选择物品装入背包，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。 问题分析：0 1背包问题是一个子集选取问题，适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入左子树，在右子树中有可能包含最优解时才进入右子树搜索；否则将右子树
beibao22
- 0.1背包问题有多种揭发，这应该是最简单的一种，很容易的写法-Variety expose of 0.1 knapsack problem, which should be the most simple, it is easy wording
SAPSO
- 0-1背包问题是学习算法时一个非常常用的简单问题，可以用多种智能优化算法实现，这里用到了蚁群算法和模拟退火算法还有两种方法的结合三种方法来实现。-0-1 knapsack problem is a simple learning algorithm is a very common problem, and can use a variety of intelligent optimization algorithm, ant colony algorithm and simulated ann
01-backpack
- ACM算法问题：0-1背包问题。此代码用vc++b编写。-ACM algorithm problem :0-1 of the knapsack problem. Write this code vc++b.
S201207109_assign02
- 利用动态规划算法实现0-1背包问题，要求测试数据以文本文件的形式存储，即所有的数据由文本文件读入。-Implementation of 0-1 knapsack problem using dynamic programming algorithm, test data are stored as text files, that all of the data from text file to read.
beibao
- 给定一个容量为C的背包及n个重量为 wi，价值为pi的物品，要求把物品装入背 包，使背包的价值最大，此类问题为背 包问题。物品或者装入背包，或者不装 入背包，称之为0/1背包问题。 -A given a capacity for the the C of the backpack, and n a of by weight for the wi, the value of for the the the items of of pi, requirements of the
ZeroOnePack
- 分支界限法求解0-1背包问题。有N件物品和一个容量为V的背包，第i件物品的费用是c[i]，价值是w[i]，求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。-Branch and bound method for solving 0-1 knapsack problem. N items and a capacity V of the backpack, the cost of items i C [i], the value of W [i], the sum of
0_1
- 实现0-1背包问题的实现,算法分析与设计-0-1 knapsack problem
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
aco-01knapsackainfo
- 蚁群算法解决0-1背包问题源码及资料，蚁群优化英文版-Ant colony algorithm to solve 0-1 knapsack problem and information source, ant colony optimization English
beibaofenti
- 大学数据结构上机作业，C++语言写的0-1背包问题解析，练习并理解0-1背包的原理。-University of machine operation data structures, C++ language to write the 0-1 knapsack problem analysis, practice and understand the principles of the 0-1 knapsack.
beibaoPSO
- 用粒子群算法解决0/1背包问题，解决在背包体积有限的情况下，如何最大化的实现有效资源分配-Solve knapsack problem with particle swarm algorithm to solve the limited volume of the backpack, how to maximize the efficient allocation of resources to achieve
GA01
- 完整解决0-1背包问题的遗传算法程序，包括输出数据统计-Complete knapsack problem solving o-1 genetic algorithm program
lab2
- 0-1背包问题：若有物品n个，每个物品的价值Value，用vi表示，每个物品的重量weight用wi表示，其中vi和wi均为非负数。设背包的总容量为W，且W为非负数。本程序可选择装入背包的物品，并使装入背包的物品总价值最大。-Value, with vi, said the weight of each item s weight by wi, where vi and wi are non-negative. The total capacity of the backpack set W,
FA2
- 一种改进的萤火虫算法解决动态0-1背包问题。经过测试，算法就有良好的性能。-Firefly Algorithm (FA), Genetic Algorithm (GA) and Differential Evolution (DE) have been widely used for static optimization problems, but the applications of those algorithms in dynamic environments are rela
QGA-AND-GA-for-knapsack
- 本源程序里面实现了基本的遗传算法与量子遗传算法实现0-1背包问题，并对实现结果截图并分析了。-The source of which the realization of the genetic algorithm and the quantum genetic algorithm to achieve the basic 0-1 knapsack problem, and the results were analyzed.
2233111
- 采用分治法、动态规划算法实现0-1背包问题的求解；动态演示算法的的实现过程。要求演示界面友好、生动，易于对算法的理解-Divide and conquer, solved using dynamic programming algorithm to achieve the 0-1 knapsack problem process dynamic demonstration algorithm. The demonstration interface is friendly and vivid,
ant-colony-algorithm-
- 现代优化算法,蚁群算法解决0-1背包问题-Modern optimization algorithm, ant colony algorithm to solve 0-1 knapsack problem
genetic-algotithm
- 遗传算法解决0-1背包问题，并有其他非遗传算法解决该问题，两种方法功能的对比-Genetic algorithm solve the 0-1 knapsack problem and other approaths to solve the same problem.The comparation of the two methods.