KnapsackProblem 0/1 knapsack problem several solut

Title: KnapsackProblem

Category:
Data structs
Tags:
[C/C++] [源码]
File Size:
154kb
Update:
2012-11-26
Downloads:
0 Times
Uploaded by:
wongruo

Description: 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.

Downloaders recently: [More information of uploader wongruo]

To Search: 0-1 Knapsack problem userfriendly source code java

[dynamic] - 0-1 knapsack problem
[optimizebackpack] - knapsack problem c algorithm, using the
[beibaowenti] - This is a backtracking algorithm used 0
[A_solution_to-knapsack-problem] - Knapsack problem is the field of combina
[0-1beibao] - 0-1 knapsack problem, this algorithm is
[zero_one_question] - Classic problem of algorithm 0- 1 knapsa
[01beibao] - 01 knapsack problem, there are four kind
[01pack] - 01 knapsack problem, using dynamic progr
[Gabor] - Gabor wavelet to have a more detailed in
[asp_chat] - a project create chat room in asp.net wi

File list (Check if you may need any files):

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