Description: 1. Familiar with dynamic programming using method 2. Analysis of the optimal sub-structure of investment 3 investment using dynamic programming to solve a total investment of $ m, a total of n items, Gi (x) for the project to the investment costs of the i when the income of x, how to allocate resources in order to maximize profits.
To Search:
File list (Check if you may need any files):
touziwenti.doc
Download