论文信息 - A unified approach to network location problems

A unified approach to network location problems

In this paper we introduce a new type of single facility location problems on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominationg set for the optimal locations are developed. Also the extension to the multi-facility case is discussed.

J. Puerto | S. Nickel

[1] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[2] Peter J. Slater,et al. Centers to centroids in graphs , 1978, J. Graph Theory.

[3] J. Halpern. Finding Minimal Center-Median Convex Combination Cent-Dian of a Graph , 1978 .

[4] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[5] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[6] G. Andreatta,et al. k-eccentricity and absolute k-centrum of a probabilistic tree , 1985 .

[7] Francesco Mason,et al. Properties of the k-centra in a tree network , 1985, Networks.

[8] Jacques-François Thisse,et al. From the Median To the Generalized Center , 1990 .

[9] Bhaba R. Sarker,et al. Discrete location theory , 1991 .

[10] John N. Hooker,et al. Finite Dominating Sets for Network Location Problems , 1991, Oper. Res..

[11] Dominique Peeters,et al. Location on networks , 1992 .

[12] Martine Labbé,et al. The Voronoi Partition of a Network and Its Implications in Location Theory , 1992, INFORMS J. Comput..

[13] H. Hamacher,et al. Multicriteria planar location problems , 1996 .

[14] Said Salhi,et al. Facility Location: A Survey of Applications and Methods , 1996 .