THE MAXIMUM-CAPTURE HIERARCHICAL LOCATION PROBLEM

被引：26

作者：

SERRA, D

MARIANOV, V

REVELLE, C

机构：

[1] CATHOLIC UNIV CHILE,SANTIAGO,CHILE

[2] JOHNS HOPKINS UNIV,BALTIMORE,MD 21218

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1992年 / 62卷 / 03期

基金：

美国国家科学基金会;

关键词：

COMPETITIVE FACILITIES; LOCATION; INTEGER PROGRAMMING;

D O I：

10.1016/0377-2217(92)90125-S

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：363 / 371

页数：9

共 13 条

[1]

FRIESZ T, 1987, ENVIRON PLANN B, V15, P191

[2] ON LOCATING NEW FACILITIES IN A COMPETITIVE ENVIRONMENT [J].