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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback