Description: a) 0-1 knapsack problem is the use of dynamic programming method, the algorithm Thought as follows : some of the problems often no way to put them into a smaller number of sub-issues, in such circumstances, it attempts problem into the necessary number of sub- problems, every child that the problem can be divided into a number of uncertainties over the need for the children, this will have a lot of the problem. If the share of the sub- problems ill-defined, overlapping, in a large number of sub-issues there will be some identical son, thus the solution of such problems, it will be possible to repeat the same number of sub- problems solution. Such duplication is unnecessary. avoid the method can solve a problem for it to the solution (including his son, son of FNL) remain, if faced with
- [bagprogram] - use dynamic programming solution to the
- [0-1wenti] - the program is a dynamic programming sol
- [tcp2002] - agreement tcp socket programming using t
- [0-1beibao] - 0-1 knapsack problem of the dynamic prog
- [0-1snap] - algorithm design and analysis of the fif
- [0-1package] - 0-1 knapsack problem branch and bound al
- [delete] - err
- [sousuo] - Algorithm Analysis and Design of the two
- [RWXML8] - the Greedy and Heuristic is used to mini
- [01package] - Completed a 01 knapsack problem solving,
File list (Check if you may need any files):
Download