META-MEDIAN AND META-CENTER PROBLEMS WITH MUTUAL COMMUNICATION - SOLVABLE SPECIAL CASES
成果类型：
Article
署名作者：
CHHAJED, D; LOWE, TJ
署名单位：
University of Iowa
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.40.1.S56
发表日期：
1992
页码：
S56-S66
关键词：
摘要：
In this paper, we consider the network version of the m-median problem with mutual communication (MMMC). We reformulate this problem as a graph theoretic node selection problem defined on a special graph. We give a polynomial time algorithm to solve the node selection problem when the flow graph (graph that denotes the interaction between pairs of new facilities in MMMC) has special structure. We also show that with some modification in the algorithm for MMMC, the m-center problem with mutual communication can also be solved when the flow graph has a special structure.