Journal article
m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
Operations research, Vol.40(1-supplement-1), pp.S56-S66
01/01/1992
DOI: 10.1287/opre.40.1.S56
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.
Details
- Title: Subtitle
- m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
- Creators
- Dilip Chhajed - University of Illinois Urbana-ChampaignTimothy J. Lowe - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Operations research, Vol.40(1-supplement-1), pp.S56-S66
- DOI
- 10.1287/opre.40.1.S56
- ISSN
- 0030-364X
- eISSN
- 1526-5463
- Publisher
- OPERATIONS RESEARCH SOC AMER; LINTHICUM HTS
- Language
- English
- Date published
- 01/01/1992
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963084802771
Metrics
1 Record Views