搜索资源列表
01bag
- 用动态规划算法所编写是01背包问题的实现，能在ACM平台上通过-Prepared by using dynamic programming algorithm implementation is 01 knapsack problem, in ACM Platforms
Deformation-knapsack-problem
- 背包问题的变形，可以更好的理解，01背包，完全背包，多重背包问题等问题-Deformation knapsack problem can be better understood, 01 backpacks, completely backpack, multiple knapsack problem and other issues
01beibao
- 使用VC编程工具，C语言实现动态规划算法解决01背包问题-Using the VC programming tool, C language implementation 01 knapsack problem solving dynamic programming algorithm
01knap
- 回溯法解决01背包问题-Backtracking to solve 01 knapsack problem
Backpack-nine-speak
- 01背包模板 多重背包模板 完全背包-01 knapsack template multiple template completely backpack
source
- home+work其实是01背包问题，二维一维都可以-home+work actually 01 knapsack problem, can be a two-dimensional one-dimensional
0-1-dynamic-program
- 01背包问题示例，有助于理解动态规划的思路和一般解决方法-to learn how to solve dynamic program
01problem--DP
- 01背包问题,利用动态规划解决一些编程算法问题。-01problem，using DP to deal with this problem and it can help you understand the way to cope with the problems like this.
Shortest-Path
- 算法中常用的01背包和单源最短路径，感兴趣的可以试着运行一下啊-Shortest Path
01beibao
- 01背包的完整版，采用动态规划和贪婪算法解决-01 backpack full version, using dynamic programming and greedy algorithm to solve
0-1backpack
- 01背包 动态规划 背包数量固定。01背包 动态规划 。-01 backpack dynamic programming
Garage
- 由Java Swing提供GUI的车库程序（01背包问题的实例化）-Provided by the Java Swing GUI garage program (instantiated 01 knapsack problem)
mpi-bag
- MPICH并行编程解决动态编程中的01背包问题-MPI solution to 0-1 bag puzzle
2014072020
- 这是一个动态规划的问题，这个程序实现的是求多段图最短路径，汉诺塔和01背包问题的程序-This is a dynamic programming problem, the program is seeking to achieve the shortest path map multistage procedure Tower of Hanoi and 01 knapsack problem
01pack
- 用C语言实现的01背包的动态规划算法，简单易懂-Dynamic programming algorithm C language 01 backpack, easy to understand
01beibao
- 01背包动态规划文字源程序 算法分析与设计-01 backpack dynamic programming
ggggg
- 01背包算法的仿真与动态演示，非常好，对数据结构的理解有帮助。-01 knapsack algorithm simulation and dynamic demonstration, very good, to understand the data structure help.
Knapsack
- 很经典的01背包以及分数背包问题的解决方案，分别用了动态规划以及递归的思想！-01Knapsack and fractional Knapsack in java
KnapsackProblem
- 算法书中的“01背包问题”的实现，由Java编写-" 01 knapsack problem" algorithm of the book, written by Java
GA0-1beibao
- Matlab 代码，用遗传算法解决01背包问题-Matlab code, using genetic algorithms to solve knapsack problem 01