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

@article{Paul2020EasyCF, title={Easy Capacitated Facility Location Problems, with Connections to Lot-Sizing}, author={Alice Paul and David P. Williamson}, journal={ArXiv}, year={2020}, volume={abs/2001.02727} }

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 (2001).

#### Topics from this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 26 REFERENCES

## A 5-Approximation for Capacitated Facility Location

VIEW 1 EXCERPT

## LP-Based Algorithms for Capacitated Facility Location

VIEW 1 EXCERPT

## Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL