logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

THE MAXIMUM-CAPTURE HIERARCHICAL LOCATION PROBLEM

delete1992-11-01
delete32
PRE
AI
D
Daniel Serra *
M
MARIANOV, V
C
Charles ReVelle
DOI：10.1016/0377-2217(92)90125-Sdelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
COMPETITIVE FACILITIES
LOCATION
INTEGER PROGRAMMING
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available