On the p‐coverage problem on the real line

Stan P. M. Van Hoesel and Albert P. M. Wagelmans

Statistica Neerlandica, 2007, vol. 61, issue 1, 16-34

Abstract: 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 logn) time, n being the number of clients.

Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.2007.00347.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:61:y:2007:i:1:p:16-34

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().