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 ...

The paper solves the stochastic inverse optimal problem. Dynamic programming is used to transform the original problem into a differential equation. Such an equation is well-defined (with probability ...

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, ...