搜索资源列表
suanfa2
- 分支限界法、分治法、动态规划法常见代码，素数环问题、背包问题、抄写书稿问题。-Branch and bound method, divide and conquer, dynamic programming method common code, prime ring problem, knapsack problem, the problem copying the manuscr ipt.
acokp
- 本程序实现了蚁群算法解决0/1背包问题，并作出了各代蚁群搜索到的最优解的图像-this program use aco to solve the problem of 0/1 bagpack
01packet
- 使用分支限界法解决01背包问题，c++代码实现，能够正确运行-Using the branch and bound method to solve the 01 knapsack problem, c++ code to run properly
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
0_1Back
- 0_1背包问题的经典贪婪算法代码和K阶优化贪婪算法代码-0_1 back
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
huisu
- 0-1背包问题的回溯法，如何用回溯（即深度优先搜索方法）来完成0-1背包问题-0-1Knapsacks Problem
pack_problem
- 根据网上的《背包九讲》写了前三个(01背包、完全背包、多重背包)的C++代码，抛砖引玉。-According to the online "backpack problem," wrote the first three (01 backpack, backpack full, multi-pack) on behalf of C Code, start a discussion.
01-beibao
- 动态规划求解01背包 vc6.0-dynamic programming 0/1 knapsack
beibao3.10
- 回溯法解决0-1背包问题 算法分析与设计实验-Backtracking to solve 0-1 knapsack problem
MAOS_QKP_1.001
- 用于解决二次背包问题的多代理优化系统， 推荐研究学习一下-MAOS-QKP is a multiagent optimization system (MAOS) for solving the Quadratic Knapsack Problem (QKP).
bag
- 本程序解决背包问题，其中有多个类型的物品，每类物品可以有任意数量。-The procedure to solve knapsack problem, in which there are multiple types of items, each class can have any number of items.
01
- 利用回溯法求01背包问题,包含了很多内容-it is good
knapsack
- 背包九讲问题，各种高效解法，值得一看，包括01背包，完全背包，多重背包，一起三种背包的混合问题-Backpack nine speak problems, all kinds of efficient solution, is worth a look Including 01 backpack, completely backpack, multiple backpack, together three backpack of the mixed problem
beibaowenti
- 主要采用遗传算法解决背包问题。是值得学习算法。-By using the genetic algorithm to solve the main knapsack problem. Is worth learning algorithm.
01bag
- 动态规划经典问题01背包的实现，用2种实现算法。一是用递归，二是用循环。还有01背包算法的叙述和图解，通俗易懂-Dynamic programming 01bag
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.
KnapSack
- 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
C.GA
- 遗传算法解决组合优化问题，0-1背包问题-Genetic algorithm to solve combinatorial optimization problems, 0-1 knapsack problem