  In this note, we consider the capacitated facility location problem when the
transportation costs of the instance satisfy the Monge property. We show that a
straightforward dynamic program finds the optimal solution when the demands are
polynomially bounded. When demands are not polynomially bounded, we give a
fully polynomial-time approximation scheme by adapting an algorithm and
analysis of Van Hoesel and Wagelmans.
