搜索资源列表
1
- 背包问题及其相应的解决方法 C++源码 背包问题及其相应的解决方法 C++源码-Knapsack problem and its corresponding solution to C++ source code knapsack problem and its corresponding solution to C++ source code
GA
- 热力学遗传算"~-(therm odynamical genetic algorithms,简称TDGA)借鉴固体退火过程中能量与熵的竞争 模式来协调GA 中“选择压力”和“种群多样性”之间的冲突.然而TDGA 目前极高的计算代价限制了其应用.为了提 高TDGA的计算效率,首先定义一种等级熵(rating—based entropy,J~j称RE)度量方法,它能以较小的计算成本度量种 群中个体适应值的分散程度.然后引入分量热力学替换规则(component thermod)rnami
1
- 背包问题体现了一种游戏规则透露游戏的本质-自动翻译
XHstudent
- 1.对多个链表进行操作 2.回溯法求解0/1背包 3.分枝限界法求解0/1背包 4.回溯法求解n—皇后问题 5.图的操作(邻接表表示)-1. Operate on multiple lists 2. Backtracking method for solving 0/1 knapsack 3. Branch and bound method for solving 0/1 knapsack 4. Backtracking to solve n-queens pr
1
- 利用贪心策略解决背包问题。现有载重为M公斤的背包和n种货物。第i种货物的重量为Wi,它的总价值为Pi,假定M、Wi、Pi均为整数。设计程序给出装货方法,使装入背包的货物总价值达到最大。-Greedy strategy to solve the knapsack problem using. Current load of M kg backpack and n kinds of goods. First i kind of cargo weight Wi, its total value of
java_n_queen
- 使用java语言, 回溯法实现n后问题和0-1背包问题-java huisu suanfa slove N Queen question
ep121
- 用动态规划方法模拟0-1背包的问题,并包含了文件。-Simulation using dynamic programming methods 0-1 knapsack problem, and contains the file.
suanfashiyan
- 十个算法小程序:二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划(多段图、0-1背包、资源分配问题)、回溯和分支限界法(子集和数问题)-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, the optimal loading, dynamic pro
dynamic-programming
- 使用c++语言,在vs2008平台上编写,用动态规划法求解0,1背包问题-C++ language use, in vs2008 platform to write, with the dynamic planning solution 0, 1 knapsack problem
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
[itpub[1].net]ACM2000
- 解决背包问题,用各种方法解决各种问题,不断的加深对问题的熟悉程度-Solve the knapsack problem, a variety of ways to solve various problems continue to deepen familiarity
Knapsack
- 背包问题(0-1背包和完全背包)动态规划代码-Code for Knapsack Problem using Dynamic Programming
jicha
- 解决1-1背包问题的最简便的解法可以有里面这一种提供出来-The easiest solution to solve the 1-1 knapsack problem can be inside this kind of out
stressen
- 解决1-1背包问题的最简便的解法可以有里面这一种提供出来-The easiest solution to solve the 1-1 knapsack problem can be inside this kind of out
1
- C语言使用回溯法实现背包问题,控制台程序。-C language knapsack problem using backtracking
ConsoleApplication1
- 0,1背包问题的C#代码实现,供学习算法使用-0,1 knapsack problem C# code to achieve for the use of the learning algorithm
beibao0-1
- 背包问题的一个lingo实现,很好的一个学习lingo的例子-The knapsack problem lingo achieve example of a learning lingo
Demo1
- 算法O-1背包问题,使用Myeclipse编写,java代码,得出最优解。-The 0-1 Knapsack
1
- 实现背包问题算法,并用MFC做出界面,画出曲线图。-Knapsack problem algorithm, and make the interface using MFC, draw graphs.
suanfa
- 内含《算法设计与分析(王晓东)》第三章课本例题的0-1背包动态规划、跳跃点优化、电路分布问题动态规划、流水作业动态规划、最优二叉树动态规划问题cpp文件和可运行程序。-Contains " Algorithm Design and Analysis (Xiaodong)" Chapter III Textbook Example 0-1 knapsack dynamic programming, jumping point optimization, dynamic progr