0 / 1背包问题的几种解决方案，包括回溯，动态规划…
资 源 简 介
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.
文 件 列 表
KnapsackByDynamicProgramming
knapsack.cpp
knapsack.h
main.cpp
KnapsackByTrackback
knapsack.cpp
knapsack.h
main.cpp
KnapsackByExhaustion
knapsack.cpp
knapsack.h
main.cpp
KnapsackByDynamicProgramming.exe
KnapsackByExhaustion.exe
KnapsackByTrackback.exe
测试报告.doc
items.txt
