Name
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). |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.orl.2019.12.006 | Operations Research Letters |
Keywords | DocType | Volume |
Lot sizing,Facility location,Monge property | Journal | 48 |
Issue | ISSN | Citations |
2 | 0167-6377 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alice Paul | 1 | 0 | 0.34 |
| David P. Williamson | 2 | 3564 | 413.34 |