Deterministic Dynamic Programming (DP) Models

This section describes the principles behind models used for deterministic dynamic programming. The subject is introduced with some contemporary applications, in computer science and biology. After this, the author outlines several well-established problem types, and explains how dynamic programming models are constructed and solved for each one. Keywords: dynamic programming; knapsack problem; job scheduling; stagecoach problem; scheduling problem