Constantine Toregas1, Ralph W. Swain1, Charles ReVelle2, Lawrence A. Bergman3
1Cornell University, Ithaca, New York
2The Johns Hopkins University Baltimore, Maryland
3Dansker Company, New York, New York
Tóm tắt
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.
