...Rabiner

Rabiner, dessen Standardwerk mir hier als Quelle einiger Definitionen dient, definiert die Methode:

Dynamic programming is an extensively studied and widely used tool in operations research for solving sequential decision problems. (...) The principle of optimality, which is the basis of a class of computational algorithms for the above optimization problem is, according to Bellmann,

An optimal policy has the property that, whatever the initial state and decision are, the remaining decisions must constitute an optional policy with regard to the state resulting from the first decision.
(Aus: L. Rabinder, Fundamentals of Speech Recognition, 204-205)

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...gibt

Weitere Ansätze finden sich bei Cormen, Leiserson & Rivest:

Dynamic programming, like the divide-and-conquer method, solves problems by combining the solutions to subproblems. (...) In contrast [to divide-and-conquer algorithms, Culjat], dynamic programming is applicable when the subproblems are not independent, that is, when subproblems share subproblems.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...Kruskal

Time Warps, String Edits, and Macromolecules, Addison-Wesley, Reading, MA, 1983

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...muß.

Bei Cormen spielt dieses Prinzip folgende Rolle:

DP is typically applied to optimization problems. In such problems there can be many possible solutions. Each solution has a value, and we wish to find a solution with the optimal (minmum or maximum) value. We call such a solution an optimal solution to the problem, as opposed to the optional solution, since there may be several solutions that achieve the optimal value.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...nieder.

In der deutschen Literatur spricht man deshalb von der Zeitverzerrung bzw. von der DP für die Zeitanpassung.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.