Easy Capacitated Facility Location Problems, with Connections to Lot-Sizing
Data Structures and Algorithms
2020-01-10 v1 Optimization and Control
Abstract
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.
Keywords
Cite
@article{arxiv.2001.02727,
title = {Easy Capacitated Facility Location Problems, with Connections to Lot-Sizing},
author = {Alice Paul and David P. Williamson},
journal= {arXiv preprint arXiv:2001.02727},
year = {2020}
}