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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback