文件名称:KnapsackProblem
介绍说明－－下载内容均来自于网络，请自行研究使用
0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
items.txt
KnapsackByDynamicProgramming
............................\knapsack.cpp
............................\knapsack.h
............................\main.cpp
KnapsackByDynamicProgramming.exe
KnapsackByExhaustion
....................\knapsack.cpp
....................\knapsack.h
....................\main.cpp
KnapsackByExhaustion.exe
KnapsackByTrackback
...................\knapsack.cpp
...................\knapsack.h
...................\main.cpp
KnapsackByTrackback.exe
测试报告.doc
KnapsackByDynamicProgramming
............................\knapsack.cpp
............................\knapsack.h
............................\main.cpp
KnapsackByDynamicProgramming.exe
KnapsackByExhaustion
....................\knapsack.cpp
....................\knapsack.h
....................\main.cpp
KnapsackByExhaustion.exe
KnapsackByTrackback
...................\knapsack.cpp
...................\knapsack.h
...................\main.cpp
KnapsackByTrackback.exe
测试报告.doc