The maximal covering location problem

This is a preview of subscription content, access via your institution.

References

  1. 1

    C. Toregas and C. ReVelle, “Optimal Location under Time or Distance Constraints,”Papers of the Regional Science Association, XXVIII, 1972.

  2. 2

    National Board of Fire Underwriters, “Standard Schedule for Grading Cities and Towns of the U.S. with Reference to their Fire Defenses and Physical Conditions,” New York, 1956.

  3. 3

    H. Huntley, “Emergency Health Services for the Nation,”Public Health Reports, LXXXV, No. 6 (June, 1970).

  4. 4

    Toregas and ReVelle,op. cit., C. Toregas and C. ReVelle, “Optimal Location under Time or Distance Constraints,”Papers of the Regional Science Association, XXVIII, 1972. p. 1.

  5. 5

    C. Toregas, C. ReVelle, R. Swain, and L. Bergman, “The Location of Emergency Service Facilities,”Operations Research, XIX, No. 5 (October, 1971).

  6. 6

    C. Toregas and C. ReVelle, “Binary Logic Solutions to a Class of Location Problems,”Geographical Analysis, V, No. 2 (April, 1973).

  7. 7

    S. Hakimi, “Optimum Location of Switching Centers and the Absolute Centers and Medians of a Graph,”Operations Research, XII (1964), p. 450.

    Google Scholar 

  8. 8

    M. Rosenthal and S. Smith, “The M-Center Problem,” Operations Research Society of America, 1967 National Meeting New York, N.Y.

  9. 9

    E. Minieka, “The M-Center Problem,”SIAM Review, XII, No. 1 (January, 1970).

  10. 10

    Ibid. E. Minieka, “The M-Center Problem,”SIAM Review, XII, No. 1 (January, 1970).

  11. 11

    R. Church, “Synthesis of a Class of Public Facilities Location Models,” Ph.D. thesis (The Johns Hopkins University, Baltimore, Md., 1974).

    Google Scholar 

  12. 12

    Ibid. R. Church, “Synthesis of a Class of Public Facilities Location Models,” Ph.D. thesis (The Johns Hopkins University, Baltimore, Md., 1974).

    Google Scholar 

  13. 13

    S. Lin, “Computer Solutions of the Traveling Salesman Problem,”The Bell System Technical Journal, XLIV (December, 1965).

  14. 14

    J. P. Ignizio and R. E. Shannon, “Heuristic Programming Algorithm for Warehouse Location,”AIIE Transactions, II, No. 4 (December 1970).

  15. 15

    J. P. Ignizio and R. M. Harnett, “Heuristically Aided Set-covering Algorithms,” Department of Industrial Engineering, University of Alabama at Huntsville, 1972.

  16. 16

    J. White and K. Case, “On Covering Problems and the Central Facilities Location Problem,” unpublished paper, Virginia Polytechnic Institute and State Univerity, Blacksburg, Va., 1973.

    Google Scholar 

  17. 17

    A. Kuehn and N. Hamburger, “A Heuristic Approach for Locating Warehouses,”Management Science, X (1963), p. 643.

    Google Scholar 

  18. 18

    H. M. Wagner,Principles of Operations Research with Applications to Managerial Decisions (Englewood Cliffs, N. J.: Prentice-Hall, 1969).

    Google Scholar 

  19. 19

    P. Rojeski and C. Re Velle, “Central Facilities Location under an Investment Constraint,”Geographical Analysis II, No. 4 (1970).

  20. 20

    R. Swain, “A Decomposition Algorithm for a Class of Facility Location Algorithms,” Ph.D. thesis (Cornell University, Ithaca, N.Y., 1971.

    Google Scholar 

  21. 21

    Churchop. cit. “Synthesis of a Class of Public Facilities Location Models,” Ph. D. thesis (The Johns Hopkins University, Baltimore, Md., 1974).

    Google Scholar 

  22. 22

    Toregas and Revelle,op. cit. “The M-Center Problem,”SIAM Review, XII, No. 1 (January, 1970).

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Church, R., ReVelle, C. The maximal covering location problem. Papers of the Regional Science Association 32, 101–118 (1974). https://doi.org/10.1007/BF01942293

Download citation

Keywords

  • Location Problem
  • Maximal Covering
  • Covering Location
  • Maximal Covering Location Problem