From dynamic programming to bynamic programming
From MaRDI portal
Publication:1260896
DOI10.1006/jmaa.1993.1243zbMath0788.90074OpenAlexW2060791951MaRDI QIDQ1260896
Publication date: 5 September 1993
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1993.1243
Related Items (4)
On Markov policies for minimax decision processes ⋮ Shortest and longest path problems ⋮ On a negative-equivalency theorem in associative optimal path problems ⋮ STRONG REPRESENTATION OF A DISCRETE DECISION PROCESS BY POSITIVELY/NEGATIVELY BITONE SEQUENTIAL DECISION PROCESS
This page was built for publication: From dynamic programming to bynamic programming