An approach to reducing the high-speed memory requirement of dynamic programming

DOI10.1016/0022-247X(65)90102-2zbMath0135.18403MaRDI QIDQ2520990

Robert E. Larson

Publication date: 1965

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

numerical analysis

Related Items (2)

Computational and approximate methods of optimal control ⋮ Dynamic programming, quasilinearization and the dimensionality difficulty

Cites Work

• A Steepest-Ascent Method for Solving Optimum Programming Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approach to reducing the high-speed memory requirement of dynamic programming