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.
Más información
Título según WOS: | ID WOS:A1992JV72600009 Not found in local WOS DB |
Título de la Revista: | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH |
Volumen: | 62 |
Número: | 3 |
Editorial: | ELSEVIER SCIENCE BV |
Fecha de publicación: | 1992 |
Página de inicio: | 363 |
Página final: | 371 |
DOI: |
10.1016/0377-2217(92)90125-S |
Notas: | ISI |