NOTES ON THE THEORY OF DYNAMIC PROGRAMMING, 5. MAXIMIZATION OVER DISCRETE SETS
RAND CORP SANTA MONICA CA
Pagination or Media Count:
The theory of dynamic programming is applied to a class of problems involving maximization over discrete sets. The solution is made to depend on the solution of a class of functional equations.
- Operations Research