This is a preview. Log in through your library . Abstract The theory of dynamic programming treats problems involving multi-stage processes by means of a transformation of the problem from the space ...

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