Dispersion of nodes added to a network

Geographical Analysis

Volumn 37, Issue 4, 2005, Pages 383-409

  Kuby, Michael ^a   Lim, Seow ^a   Upchurch, Christopher ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISPERSION; LOCATION DECISION; NETWORKING; SPATIAL ANALYSIS;

EID: 29144471179     PISSN: 00167363     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.0016-7363.2005.03704002.x     Document Type: Review

References (22)

1. Herman, O., and D. Simchi-Levi. (1988). "A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks." Operations Research 36, 478-84.
2. Chandrasekaran, R., and A. Daughety. (1981). "Location on Tree Networks: P-Centre and P-Dispersion Problems." Mathematics of Operations Research 6, 50-57.
3. Church, R. L., and B. Meadows. (1979). "Location Modeling using Maximum Service Distance Criteria." Geographical Analysis 11, 358-73.
4. Church, R. L., and C. ReVelle. (1974). "The Maximal Covering Location Problem." Papers of the Regional Science Association 32, 101-18.
5. Erkut, E. (1990). "The Discrete p-Dispersion Problem." European Journal of Operational Research 46, 48-60.
6. Erkut, E., and S. Neuman. (1989). "Analytical Models for Locating Undesirable Facilities." European Journal of Operational Research 40, 275-91.
7. Erkut, E., and S. Neuman. (1991). "Comparison of Four Models for Dispersing Facilities." INFOR 29, 68-86.
8. Erkut, E., Y. Ulkusal, and O. Yenicerioglu. (1994). "A Comparison of p-Dispersion Heuristics." Computers and Operations Research 21, 1103-13.
9. Hakimi, S. L. (1964). "Optimum Locations of Switching Centres and the Absolute Centres and Medians of a Graph." Operations Research 12, 450-459.
10. Hakimi, S. L. (1965). "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems." Operations Research 13, 462-75.
11. Handler, G. Y., and P. B. Mirchandani. (1979). Location on Networks: Theory and Algorithms. Cambridge, MA: MIT Press.
12. Hooker, J. N., R. S. Garfinkel, and C. K. Chen. (1991). "Finite Dominating Sets for Network Location Problems." Operations Research 39, 100-18.
13. Kincaid, R. K., and L. G. Yellin. (1993). "The Discrete p-Dispersion-Sum Problem: Results on Trees and Graphs." Location Science 1, 171-86.
14. Kuby, M. (1987). "Programming Models for Facility Dispersion: The p-Dispersion and Maxisum Dispersion Problems." Geographical Analysis 19, 315-29.
15. Kuby, M. (1989). "A Location-Allocation Model of Lösch's Central Place Theory: Testing on a Uniform Lattice Network." Geographical Analysis 21, 316-38.
16. Kuby, M., and S. Lim. (2005). "The Flow-Refueling Location Problem for Alternative-Fuel Vehicles." Socio-Economic Planning Sciences 39, 125-45.
17. Minieka, E. (1970). "The m-Center Problem." SIAM Review 12, 138-39.
18. Moon, I. D., and S. S. Chaudhry. (1984). "An Analysis of Network Location Problems with Distance Constraints." Management Science 30, 290-307.
19. Shier, D. R. (1977). "A Min-Max Theorem for p-Center Problems on a Tree." Transportation Science 11, 243-52.
20. Tansel, B. C., R. L. Francis, and T. J. Löwe. (1983a). "Location on Networks: A Survey. Part I: The p-Center an p-Median Problems." Management Science 29, 482-97.
21. Tansel, B. C., R. L. Francis, and T. J. Lowe. (1983b). "Location on Networks: A Survey. Part I: Exploiting Tree Network Structure." Management Science 29, 498-511.
22. Toregas, C., R. Swain, C. ReVelle, and L. Bergman. (1971). "The Location of Emergency Service Facilities." Operations Research 19, 1363-73.