Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type

Publisher Website
Google Scholar
Abstract
A general formulation of discrete deterministic dynamic programming is given. This definition is obtained formally by derivation of a simplified algorithm from a general algorithm, and gives simultaneously the class of concurrent problems.