On the P-coverage Problem on the Real Line
Name
OR-255-91.pdf
Size
1.28 MB
Format
Adobe PDF
Checksum (MD5)
20a82945d5ac0c5311c03c030b669e69
Author(s)
Hoesel, Stan Van
Wagelmans, Albert
Date Issued
June 1991
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 251-91
Abstract
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(pnlogn) time, n being the number of clients. OR/MS subject classification: Analysis of algorithms, computational complexity: parametric application of dynamic programming; Dynamic programming/optimal control, applications: parametric approach to p-coverage problem on the real line; Facilities/equipment planning, location, discrete: p-coverage problem on the real line.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
