Name
Abstract | ||
|---|---|---|
We consider a generalization of the maximal cover location problem which allows for partial coverage of customers, with the degree of coverage being a non-increasing step function of the distance to the nearest facility. Potential application areas for this generalized model to locating retail facilities are discussed.We show that, in general, our problem is equivalent to the uncapacitated facility location problem. We develop several integer programming formulations that capitalize on the special structure of our problem. Extensive computational analysis of the solvability of our model under a variety of conditions is presented. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0305-0548(01)00079-X | Computers & OR |
Keywords | Field | DocType |
uncapacitated facility location problem,maximal cover location problem,integer programming formulation,generalized model,generalized maximal,Integer programming,Strong and weak formulations,nearest facility,partial coverage,extensive computational analysis,Maximal cover location problem,potential application area,non-increasing step function,retail facility | Mathematical optimization,Integer programming,Mathematics,Step function | Journal |
Volume | Issue | ISSN |
29 | 6 | Computers and Operations Research |
Citations | PageRank | References |
65 | 46.85 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| O. Berman | 1 | 1604 | 231.36 |
| Dmitry Krass | 2 | 483 | 82.08 |