A hypercube queuing model for facility location and redistricting in urban emergency services

Computers and Operations Research

Volumn 1, Issue 1, 1974, Pages 67-95

  Larson, Richard C ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002702050     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(74)90076-8     Document Type: Article

References (21)

1. Methods for allocating urban emergency units A survey
2. An analysis of private and public sector location models
3. On the division of police districts into patrol beats
4. Nonpartisan political redistribution by computer
5. The use of probability theory in the assignment of police patrol areas
6. A computer model for the evaluation of fire station location
7. Locating ambulance dispatch centers in an urban region: A man computer interactive problem-solving approach
8. Solving urban location problems Human intervention versus the computer
9. The location of emergency service facilities
10. Optimum locations of switching centers and the absolute centers and medians of a graph
11. Optimum distribution of switching centers in communications networks and some related graph theoretic problems
12. Response areas for two emergency units
13. On insensitivities in urban redistricting and facility location
14. A spatially distributed queuing model with application to police sector design
15. On the solution of linear simultaneous equations by iteration
16. When a queue looks the same to an arriving customer as to an observer
17. Illustrative police sector redesign in district 4 in Boston