Coveting algorithm 01 knapsack
2016-08-23
1 0 0
no vote
Other
Earn points
Improved knapsack problem: given a super increasing sequence and the capacity of a knapsack, then select (only once) or not select each value in the super increasing sequence, so that the sum of the selected values is exactly equal to the capacity of the knapsack.
c
算法
求解
背包
贪恋
Related Source Codes
PClite
0
0
no vote
generic embeded FTP Client
0
0
no vote
UDP Test Demo
0
0
no vote
TMS320F28335 DSP transmits data to EEPROM through
0
0
no vote
TMS320F28335 CAN communication source code
0
0
no vote
No comment