Another exact technique which enumerates the feasible solutions for an optimization problem is named dynamic programming. Like branch and bound, all feasible solutions are considered, but in a very different manner. Instead of forming permutations of the elements found in solutions, we concentrate on combinations. Also, we shall work backwards from solutions instead of forward as in other enumeration techniques. Thus dynamic programming is a deductive rather than an inductive process.

The sections are entitled: