A unified approach to network location problems

Networks

Volumn 34, Issue 4, 1999, Pages 283-290

  Nickel, Stefan ^a   Puerto, Justo ^b  

^a University of Koblenz Landau   (Germany)

^b UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Location theory; Network problems

Indexed keywords

EID: 0033427299     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199912)34:4<283::AID-NET8>3.0.CO;2-2     Document Type: Article

References (20)

1. [1] G. Andreatta and F.M. Mason, Properties of the k-centra in a tree network, Networks 15 (1985), 21-25.
2. [2] G. Andreatta and F.M. Mason, k-Eccentricity and absolute k-centrum of a probabilistic tree, Eur J Oper Res 19 (1985), 114-117.
3. [3] J.L. Bentley and T. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans Comput 28 (1979), 643-647.
4. [4] Z. Drezner, (Editor), Facility location. A survey of applications and methods, Springer, New York, 1995.
5. [5] S.L. Hakimi, Optimum location of switching centers and the absolute centers and medians of a graph, Oper Res 12 (1964), 450-459.
6. [6] J. Halpern, Finding the minimal center-median convex combination (cent-dian) of a graph, Mgmt Sci 24 (1978), 535-547.
7. [7] H.W. Hamacher and S. Nickel, Multicriteria planar location problems, Eur J Oper Res 94 (1996), 66-86.
8. [8] P. Hansen, M. Labbé, and J.F. Thisse, From the median to the generalized center, RAIRO OR 25 (1991), 73-86.
9. [9] S.L. Hakimi, M. Labbé, and E. Schmeichel, The Voronoi partition of a network and its applications in location theory, ORSA J Comput 4 (1992), 412-417.
10. [10] G.H. Hardy, J.E. Littlewood, and G. Polya, Inequalities, Cambridge University Press, Cambridge, 1951.
11. [11] J.N. Hooker, R.S. Garfinkel, and C.K. Chen, Finite dominating sets for network location problems, Oper Res 39 (1991), 100-118.
12. [12] O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems I: The p-centers, SIAM J Appl Math 37 (1979), 513-538.
13. [13] O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems II: The p-medians, SIAM J Appl Math 37 (1979), 539-560.
14. [14] M. Labbé, D. Peeters, and J.-F. Thisse, Location on networks, Handbooks in OR & MS, Vol. 8, M.O. Ball et al. (Editors), Elsevier, Amsterdam, 1995.
15. [15] J. Puerto and F.R. Fernández, The symmetrical single facility location problem, Prepublicaciones de la Facultad de Matemáticas de la Universidad de Sevilla, 1995.
16. [16] P.B. Mirchandani and R.L. Francis (Editors), Discrete location theory, Wiley, New York, 1990.
17. [17] D. Pérez-Brito, J. Moreno-Pérez, and I. Rodríguez-Marín, The finite dominating set for the p-facility cent-dian network location problem, Stud Loc Anal 11 (1997), 27-40.
18. [18] J. Puerto (Editor), Lectures en Teoría de Localización, Secretariado de Publicaciones de la Universidad de Sevilla, Serie Ciencias n. 46 (in Spanish), 1996.
19. [19] P. Slater, Centers to centroids in graphs, J Graph Theory 2 (1978), 209-222.
20. [20] J.R. Weaver and R.L. Church, A median location model with non-closets facility service, Trans Sci 7 (1985), 18-23.