A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem

The single-sink, fixed-charge transportation problem has a variety of applications, including supplier selection, product distribution/fleet selection, and process selection. In this paper we present a dynamic programming algorithm for solving this important problem that is very easy to implement and that improves considerably in terms of computational attractiveness on the best methods in the literature.