Name
Abstract | ||
|---|---|---|
In covering problems it is assumed that there is a critical distance within which the demand point is fully covered, while beyond this distance it is not covered at all. In this paper we define two distances. Within the lower distance a demand point is fully covered and beyond the larger distance it is not covered at all. For a distance between these two values we assume a gradual coverage decreasing from full coverage at the lower distance to no coverage at the larger distance. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0377-2217(02)00604-5 | European Journal of Operational Research |
Keywords | Field | DocType |
Location,Networks,Integer programming,Maximal cover problems | Discrete mathematics,Mathematical optimization,Critical distance,Integer programming,Mathematics,Covering problems | Journal |
Volume | Issue | ISSN |
151 | 3 | 0377-2217 |
Citations | PageRank | References |
48 | 2.56 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| O. Berman | 1 | 1604 | 231.36 |
| Dmitry Krass | 2 | 483 | 82.08 |
| Zvi Drezner | 3 | 1195 | 140.69 |