Abstract
Upgrading p-median problem is a problem of finding the best median of the given graph through modification of its parameters. The current paper develops a polynomial-time model to address this problem when the weights of vertices can be varying under a given budget. Moreover, in the case where the considering graph has a special structure, namely a path, a linear time algorithm will be proposed for solving the problem with uniform cost.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berman, O., Ingco, D.I., Odoni, A.: Improving the location of minsum facilities through network modification. Ann. Oper. Res. 40, 1–16 (1992)
Burkard, E.R., Gassner, E., Hatzl, J.: A linear time algorithm for the reverse 1-median problem on a cycle. Networks 48, 1623 (2006)
Burkard, E.R., Gassner, E., Hatzl, J.: Reverse 2-median problem on trees. Discret. Appl. Math. 156, 1963–1976 (2008)
Burkard, R.E., Pleschiutschnig, C., Zhang, J.: Inverse median problems. Discret. Optim. 1, 23–39 (2004)
Burkard, R.E., Pleschiutschnig, C., Zhang, J.: Inverse median problem on a cycle. Discret. Optim. 5, 242–253 (2009)
Baroughi, F., Burkard, R.E., Gassner, E.: Inverse p-median problems with variable edge lengths. Math. Meth. Oper. Res. 73, 263–280 (2011)
Burkard, R.E., Galavii, M., Gassner, E.: The inverse fermat-weber problem. Eur. J. Oper. Res. 206(1), 11–17 (2010)
Sepasian, A.R., Rahbarnia, F.: An O(n log n) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization A Journal of Mathematical Programming and Operations Research (2013). doi:10.1080/02331934.2013.783033.
Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Oper. Res. 28, 1130–1154 (1980)
Mirchandani, P., Francis, R.: Discrete Location Theory. Wiley (1990)
Fulkerson, D.R., Harding, G.C.: Maximizing the minimum source-sink path subject to a budget constraint. Math. Program. 13, 116–118 (1977)
Hambrusch, S.E., Tu, H.-Y.: Edge weight reduction problems in directed acyclic graphs. J. Algoritm. 24(1), 66–93 (1997)
Phillips, C.A.: The network inhibition problem. In: Annual ACM Symposium on Theory of Computing, Proceedings of the 25th Annual ACM Symposium on Theory of Computing Table of Contents San Diego, pp. 776–785 (1993)
Dragmeister, K.U., Krumke, S.O., Marathe, M.V., Noltemeier, H., Ravi, S.S.: Modifying edges of a network to obtain short subgraphs. Theor. Comput. Sci. 203, 91–121 (1998)
Frederickson G.N., Solis-Oba R.: Increasing the weight of minimum spanning trees. J. Algorithm. 33(2), 244–266 (1999)
Krumke, S.O., Marathe, M.V., Noltemeier, H., Ravi, R., Ravi, S.S.: Approximation algorithms for certain network improvement problems. J. Comb. Optim. 2, 257–288 (1998)
Gassner, E.: Up- and downgrading the 1-center in a network. Eur. J. Oper. Res. 198, 370–377 (2008)
Gassner, E.: Up- and downgrading the 1-median in a network. Technical Report 2007-16, Graz University of Technology
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sepasian, A.R., Rahbarnia, F. Upgrading p-Median Problem on a Path. J Math Model Algor 14, 145–157 (2015). https://doi.org/10.1007/s10852-014-9265-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-014-9265-9