Dynamic programming is optimal for certain sequential decision processes (Q1139505)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic programming is optimal for certain sequential decision processes |
scientific article; zbMATH DE number 3675648
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming is optimal for certain sequential decision processes |
scientific article; zbMATH DE number 3675648 |
Statements
Dynamic programming is optimal for certain sequential decision processes (English)
0 references
1980
0 references
dynamic programming
0 references
sequential decision processes
0 references
minimum-cost path
0 references
monotone loop-free sequential decision process
0 references
