论文信息 - The maximum-capture hierarchical location problem

The maximum-capture hierarchical location problem

Abstract In this paper we present a 0–1 integer programming model for locating services with a hierarchical structure when there is competition in the region of interest. The model utilizes a hierarchical covering formulation and it allows the location of new servers as well as the relocation of existing servers. Computational experience is provided.

Vladimir Marianov | Daniel Serra | Charles ReVelle

[1] Subhash C. Narula. Hierarchical location-allocation problems: A classification scheme , 1984 .

[2] Charles ReVelle,et al. The Hierarchical Service Location Problem , 1982 .

[3] H. Hotelling. Stability in Competition , 1929 .

[4] Charles ReVelle,et al. THE MAXIMUM CAPTURE OR “SPHERE OF INFLUENCE” LOCATION PROBLEM: HOTELLING REVISITED ON A NETWORK* , 1986 .

[5] T. Friesz,et al. Spatial competition facility location models: Definition, formulation and solution approach , 1986 .

[6] R. Swain. A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems , 1974 .

[7] Pierre Hansen,et al. Facility location analysis , 1987 .

[8] S. Hakimi. On locating new facilities in a competitive environment , 1983 .

[9] T. Friesz,et al. Algorithms for Spatially Competitive Network Facility-Location , 1988 .

[10] M. J. Hodgson,et al. A hierarchical location-allocation model with allocations based on facility size , 1986 .

[11] D. Serra,et al. The Maximum Capture Problem Including Relocation , 1991 .