Read our cookies policy and privacy statement for more information.
×Charlotte, North Carolina
The identification of dynamic programming problems and their solution in terms of recurrence relations. Elementary path problems, resource allocation, shortest path, traveling salesmen problem, discrete-time optimal control, replacement models, and inventory systems. A project is required of all graduate students.
Units: 3.0