Dynamic Programming and "Difficult Crossing" Puzzles
From MaRDI portal
Publication:3849456
DOI10.2307/2689096zbMath0112.12402OpenAlexW4244337384WikidataQ56674465 ScholiaQ56674465MaRDI QIDQ3849456
Publication date: 1962
Published in: Mathematics Magazine (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2689096
Related Items (8)
Interior point method for long-term generation scheduling of large-scale hydrothermal systems ⋮ The skyline algorithm for POMDP value function pruning ⋮ Game problem of the design of a multi-impulse motion correction ⋮ Remarks on optimal controls of stochastic partial differential equations ⋮ On a class of convex allocation problems ⋮ Algorithms for sequential analysis and fathoming in discrete optimization problems ⋮ Generalized river crossing problems ⋮ Optimal control model with energy criterion in stochastic Lagrange mechanics
This page was built for publication: Dynamic Programming and "Difficult Crossing" Puzzles