Solves the 0-1 knapsack problem using preprocessing and dynamic programming. in matlab

The following Matlab project contains the source code and Matlab examples used for solves the 0-1 knapsack problem using preprocessing and dynamic programming. . [FMAX,X] = KP01(W,P,C) solves the combinatorial optimization problem       maximize F = SUM(P.

The source code and files included in this project are listed in the project files section, please make sure whether the listed source code meet your needs there.

Project Files: 

File NameSize
kp01.m 7169
license.txt 1314