artículo
THE MAXIMUM-CAPTURE HIERARCHICAL LOCATION PROBLEM
Fecha
1992Registro en:
10.1016/0377-2217(92)90125-S
0377-2217
WOS:A1992JV72600009
Autor
SERRA, D
MARIANOV, V
REVELLE, C
Institución
Resumen
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.