Paper Info
Title
m-median and m-center problems with mutual communication: solvable special cases
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 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.
Year
DOI
Venue
1992
10.1287/opre.40.1.S56
Operations Research
Field
DocType
Volume
Strength of a graph,Mathematical optimization,Combinatorics,Line graph,Graph property,Simplex graph,Directed graph,Null graph,Butterfly graph,Voltage graph,Mathematics
Journal
40
Issue
ISSN
Citations 
S1
0030-364X
5
PageRank 
References 
Authors
0.69
0
2
Name
Order
Citations
PageRank
Dilip Chhajed133927.21
Timothy J. Lowe237739.67