Dynamic Programming and "Difficult Crossing" Puzzles

DOI10.2307/2689096MaRDI QIDQ3849456zbMATH OpenOpenAlexWikidataFDO

Authors Richard Bellman

Publication date 1962

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2689096

zbMATH Keywords

applications of probability theory and statistics

Cited in

(8)

• Game problem of the design of a multi-impulse motion correction
• Remarks on optimal controls of stochastic partial differential equations
• Optimal control model with energy criterion in stochastic Lagrange mechanics
• The skyline algorithm for POMDP value function pruning
• Generalized river crossing problems
• On a class of convex allocation problems
• Algorithms for sequential analysis and fathoming in discrete optimization problems
• Interior point method for long-term generation scheduling of large-scale hydrothermal systems

This page was built for publication: Dynamic Programming and "Difficult Crossing" Puzzles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3849456)