搜索资源列表
bag
- 介绍了0-1背包问题的求解，并用贪心算法解决了背包问题-Introduced to solve 0-1 knapsack problem and solved with the greedy algorithm knapsack problem
01
- 01背包问题，利用的是动态规划的思想，不是改进的01背包算法-01 knapsack problem, the use of dynamic programming is the idea, not the 01 knapsack algorithm to improve
ANT-TX
- 用蚁群算法和贪心算法解决0/1背包问题。可用于不同算法的比较。-Solving 0/1 Knapsack Problem by ant colony algorithm and greed method.Can be used to compare two algorithms.
huoxiang
- 0/1背包问题的k阶优化算法，k=0,1,2.-0/1 knapsack problem of k-order optimization algorithm, k = 0,1,2.
KNAPSACK
- 0-1背包问题，用动态规划做的，很不错，供大家传阅。算法设计的原型。我给具体实现了。-0-1 knapsack problem, using dynamic programming to do, very good for your circulation. Algorithm design prototype. I gave a concrete realization.
0-1beibao
- 算法与分析中0/1背包问题的实现，求出最大价值及所放入的背包序号-Algorithms and Analysis 0/1 knapsack problem to achieve, find the maximum value and the serial number into the backpack
0-1bag
- 解决了0-1背包问题，能够的出最优解；并且可以知道各个背包的号码和总重量。-To solve the 0-1 knapsack problem, to the optimal solution and can know each number and total weight of the backpack.
suanfashiyan
- 十个算法小程序：二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划（多段图、0-1背包、资源分配问题）、回溯和分支限界法（子集和数问题）-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, th
arithmetic
- 采用c++语言实现动态规划问题、0-1背包问题、背包问题knap1.cpp、knap.cpp、dynamic.cpp！-The c++ language realize dynamic planning 0-1 knapsack problems knapsack problem knap1. CPP knap.CPP dynamic.CPP
code
- 动态规划法各种源码，包括0,1背包，多边形游戏，矩阵连乘，数字三角形，图像压缩-Dynamic planning method for a variety of source code, including the 0, 1 backpacks, Polygon game, matrix multiplication, the number of triangles, image compression and so on.
0-1beibao
- 蚁群算法求解0-1背包问题，压缩包中有详细的代码和实验报告，可以调试运行-Ant Colony Algorithm for the 0-1 knapsack problem, compressed package are detailed in the code and lab reports, debugging and running
huisufa0-1
- 算法分析-回溯法，0-1背包问题，按选优条件向前搜索，以达到目标。-Algorithm- Backtracking，0-1Knapsack problem，Forward search, the optimal selection conditions in order to achieve the goal.
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 belie
jicha
- 解决1-1背包问题的最简便的解法可以有里面这一种提供出来-The easiest solution to solve the 1-1 knapsack problem can be inside this kind of out
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.
box
- 基于动态规划法的0-1背包问题，本代码实现了背包问题的详细过程。-0-1 knapsack problem based on dynamic programming, the code to achieve the detailed process of the knapsack problem.
knapsack
- 本源程序主要是实现算法中的0-1背包问题，此程序在Visual C++6.0下实现-implement the knapsack problem
aco-01knapsackainfo
- 蚁群算法解决0-1背包问题源码及资料，蚁群优化英文版-Ant colony algorithm to solve 0-1 knapsack problem and information source, ant colony optimization English
bag
- 非常经典的0-1背包问题采用贪心算法实现-Very classical 0-1 knapsack problem using greedy algorithm
数据结构经典问题
- 数据结构经典问题算法：背包问题、数字三角问题、凸多边形划分问题等！