Author(s)

Chunsong Bai¹, Liqi Zhang², Jianjie Zhou^2*

¹School of Finance and Mathematics, Huainan Normal University, Huainan, China.
²Department of Information & Computational Science, Henan Agricultural University, Zhengzhou, China.

Recently, the inverse connected p-median problem on block graphs G(V,E,w) under various cost functions, say rectilinear norm, Chebyshev norm, and bottleneck Hamming distance. Their contributions include finding a necessary and sufficient condition for the connected p-median problem on block graphs, developing algorithms and showing that these problems can be solved in O(n log n) time, where n is the number of vertices in the underlying block graph. Using similar technique, we show that some results are incorrect by a counter-example. Then we redefine some notations, reprove Theorem 1 and redescribe Theorem 2, Theorem 3 and Theorem 4.

Location Theory, Block Graphs, Inverse Optimization, Connected p-Median

Bai, C. , Zhang, L. and Zhou, J. (2023) A Note on the Inverse Connected p-Median Problem on Block Graphs. Advances in Pure Mathematics, 13, 181-186. doi: 10.4236/apm.2023.134011.