搜索资源列表
01beibao
- 0-1背包问题,用动态规划算法来实现的.-0-1 knapsack problem with dynamic programming algorithm to achieve.
01beibao
- 算法与数据结构——快速排序 01背包问题,是一个简单的程序,高手就不用研究了
01beibao
- 0-1背包问题，用VC++实现，是算法设计中比较重要的问题
01beibao
- 算法与数据结构——快速排序 01背包问题,是一个简单的程序,高手就不用研究了-Algorithms and data structures- quick sort 01 knapsack problem is a simple procedure, you need to conduct a study on the
01beibao
- 0-1背包问题，用VC++实现，是算法设计中比较重要的问题-0-1 knapsack problem, using VC++ Realize is that algorithm design more important issue
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
01beibao
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
01beibao
- 有一批集装箱要装上一艘载重量为c的轮船.其中集装箱i的重量为Wi.最优装载问题要求确定在装载体积不受限制的情况下,将尽可能多的集装箱装上轮船-A group of containers to be loaded onto a ship load of c. In which the weight of the container i is Wi. Loading problem requires to determine the opt
01beibao
- 动态规划问题中的01背包问题，需要的可以看下了-Dynamic programming problem in the 01 knapsack problem, in need may have a look up. .
01beibao(dongtaiguihua)
- 01背包问题的动态规划算法，能运行，我调好的-01 knapsack problem dynamic programming algorithm, to run, I am a good tune
01beibao
- c++中运用动态规划解决01背包问题可以运行，有汉字说明-c++ using dynamic programming to solve the knapsack problem can run 01, with characters that ~ ~
01beibao
- 01 背包 自己编写的一个小算法 希望够帮助大家-Back pack
huisufa--01beibao
- 讲述了0-1背包问题的解决，是讲课用的课件。希望对大家会有帮助-it is a problem about 0-1 bag
01beibao
- 用C语言写的挤牛奶背包问题的算法，方便大家借鉴学习-The milking of the knapsack problem algorithms written in C language, to facilitate learn from
01beibao
- 01背包问题的回溯算法与实现 已知一个容量为M的包和n件物品, 每件物品的重量为wi, 效益值为pi. 若将物品i装入包中, 背包可得到pi的效益值增量. 要求找到一种装入物品的方案, 在不超过包的总容量前提下, 使包获得最大效益值,-01 knapsack problem backtracking algorithm and implementation of
01beibao
- 用一维数组解决背包问题，十分经典，可提升空间基本没有-With a one-dimensional array to solve knapsack problem, very classic, can be basically no room for improvement
01beibao
- 使用VC编程工具，C语言实现动态规划算法解决01背包问题-Using the VC programming tool, C language implementation 01 knapsack problem solving dynamic programming algorithm
01beibao
- 0-1背包问题，空间点对问题，图形压缩，线性时间选择以及最优二叉树的java脚本程序-0-1 knapsack problem, the point of the problem space, image compression, linear time optimal tree selection and java scr ipt program
01beibao
- 01背包的完整版，采用动态规划和贪婪算法解决-01 backpack full version, using dynamic programming and greedy algorithm to solve