Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
From MaRDI portal
Publication:5628774
DOI10.1145/321607.321616zbMath0223.49021OpenAlexW2074379139MaRDI QIDQ5628774
Publication date: 1970
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321607.321616
Related Items (7)
Richard Bellman's contributions to computer science ⋮ The principle of optimality in the design of efficient algorithms ⋮ A general framework for enumerating equivalence classes of solutions ⋮ Classes of discrete optimization problems and their decision problems ⋮ Multilevel decomposition of nonlinear programming problems by dynamic programming ⋮ Solvable classes of discrete dynamic programming ⋮ A Comprehensive Model of Dynamic Programming
This page was built for publication: Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
