We present a dynamic programming algorithm for solving the single-unit commitment (1UC) problem with ramping constraints and arbitrary convex cost functions. The algorithm is based on a new approach ...

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