论文标题
易于电容的设施位置问题，与批号的连接
Easy Capacitated Facility Location Problems, with Connections to Lot-Sizing
论文作者
论文摘要
在本说明中，当实例的运输成本满足Monge财产时，我们考虑了电容设施的位置问题。我们表明，直接的动态程序在多项式边界时找到了最佳解决方案。当需求不是多项式界限时，我们通过调整算法和范·霍瑟（Van Hoesel）和瓦格尔曼斯（Wagelmans）的分析来提供完全多项式时间近似方案。
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.
