Answers are grounded in this paper and cite their sources.
This paper views the location of emergency facilities as a set covering problem with equal costs in the objective. The sets are composed of the potential facility points within a specified time or distance of each demand point. One constraint is written for each demand point requiring “cover,” and linear programming is applied to solve the covering problem, a single-cut constraint being added as necessary to resolve fractional solutions.
No takes yet. Share an insight, caveat, or question.
Toregas et al. (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: