On the p-coverage problem on the real line
In this paper we consider the p-coverage problem on the real line. We first give a detailed description of an algorithm to solve the coverage problem without the upper bound p on the number of open facilities. Then we analyze how the structure of the optimal solution changes if the setup costs of the facilities are all decreased by the same amount. This result is used to develop a parametric approach to the p-coverage problem which runs in O ( pn n) time, n being the number of clients.
|Keywords||algorithm, combinatorial optimization, computational complexity, dynamic programming, mathimatical optimization, parametric optimization|
|Persistent URL||dx.doi.org/10.1111/j.1467-9574.2007.00347.x, hdl.handle.net/1765/14362|
van Hoesel, S, & Wagelmans, A.P.M. (2007). On the p-coverage problem on the real line. Statistica Neerlandica, 61(1), 16–34. doi:10.1111/j.1467-9574.2007.00347.x