Easy Capacitated Facility Location Problems, with Connections to Lot-Sizing

01/08/2020

∙

by   Alice Paul, et al.

∙

0

∙

share

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.