Description: c++ using backtracking to achieve the 01 knapsack problem
Stage: the first N items, select the number of items into the backpack status is: the first N items, select the number of items into the remaining space in the backpack for the W available to the greatest value Decision-making is: The first N items put or hold
To Search:
File list (Check if you may need any files):
01\01背包.dsp
..\01背包.dsw
..\01背包.ncb
..\01背包.opt
..\01背包.plg
..\01背包（回溯法）.cpp
..\Debug\01背包.exe
..\.....\01背包.ilk
..\.....\01背包.pch
..\.....\01背包.pdb
..\.....\01背包（回溯法）.obj
..\.....\vc60.idb
..\.....\vc60.pdb
..\Debug
01
Download