m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases

Dilip Chhajed and Timothy J. Lowe
Additional contact information
Dilip Chhajed: University of Illinois, Champaign, Illinois
Timothy J. Lowe: University of Iowa, Iowa City, Iowa

Operations Research, 1992, vol. 40, issue 1-supplement-1, S56-S66

Abstract: 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 a 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.

Keywords: networks/graphs; location analysis: m-median and m-center problems; networks/graphs; theory: series-parallel graphs (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.1.S56 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:40:y:1992:i:1-supplement-1:p:s56-s66

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().