We present a dynamic programming algorithm for solving this so-called single-sink, fixed-charge, multiple-choice transportation problem exactly. The method exploits heuristics and lower bounds to ...

A two-dimensional dynamic programming problem is posed. By relaxing some of the restraints on the problem it is reduced to a standard dynamic programming problem. Results are quoted from a particular ...

The Dynamic Programming and Optimal Control class focuses on optimal path planning and solving optimal control problems for dynamic systems. It stands out for several reasons: It is multidisciplinary, ...