| Author: | Chhajed, D. Lowe, T. J. |
| Title: | m-median and m-center problems with mutual communication: solvable special cases |
| Journal: | Operations Research
1992 : JAN-FEB, VOL.40:SUP.1, p.S56-S66 |
| Index terms: | COMMUNICATION GRAPHS LOCATION PROBLEM ALGORITHMS |
| Language: | eng |
| Abstract: | Polynomial time algorithms for special cases of the m-median and m-center problems with mutual communication are provided. The special case is characterized by the structure of the flow graph. The m-median problem with mutual communication is reformulated as a quadratic location problem which is then formulated as a node selection problem (NSP) posed on a G-partie graph. Then Algorithm SP is presented which solves NSP when the flow graph is series-parallel. The m-center problem with mutual communication is formulated as the bottleneck version of the node selection problem. |
SCIMA