The Maximal Covering Location Problem.¶
Church, R., & ReVelle, C. (1974). The Maximal Covering Location Problem. Papers of the Regional Science Association, 101-118.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Dense Set
- The host space is the populated region (every household location); the stand-in subset is the finite set of clinic sites; the notion of closeness is drive time, with tolerance \(\varepsilon\) a policy maximum (say 30 minutes).
This sourceSeminal facility-location model that sites a limited set of facilities so that demand (households) lies within a maximum distance/time tolerance — the service-geography coverage instance of density.
- The host space is the populated region (every household location); the stand-in subset is the finite set of clinic sites; the notion of closeness is drive time, with tolerance \(\varepsilon\) a policy maximum (say 30 minutes).
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:b3db928bb07f · see in the full table