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

THE ZONE-CONSTRAINED LOCATION PROBLEM ON A NETWORK

delete1991-07-01
delete9
PRE
AI
O
O. Berman *
D
D. Einav
G
G. Handler
DOI：10.1016/0377-2217(91)90089-Edelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper we consider the m-median and m-center problems on a network, subject to zone-type constraints. These constraints require that at least one server be located in each one of several perspecified zones that may overlap. The zones may be municipal districts, geographical zones, equity-type zones and so on. Special cases of the problem include the m-medi-center problem and the m-center (or m-median) problem with user-dependent distance constraints. The paper includes a relaxation algorithm where in each step of the algorithm a relaxed problem is solved. For the m-center problem with user-dependent distance constraints the relaxation algorithm can be refined by taking advantage of an available method to solve the relaxed problem. Computational experience suggests that the algorithm performs well for large problems.
Keywords:
LOCATION
ZONE CONSTRAINTS
NETWORKS

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