{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:42:12Z","timestamp":1786981332088,"version":"build-2736575974"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,2]],"date-time":"2014-10-02T00:00:00Z","timestamp":1412208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10852-014-9265-9","type":"journal-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T04:13:57Z","timestamp":1412136837000},"page":"145-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Upgrading p-Median Problem on a Path"],"prefix":"10.1007","volume":"14","author":[{"given":"Ali Reza","family":"Sepasian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Freydoon","family":"Rahbarnia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,10,2]]},"reference":[{"key":"9265_CR1","doi-asserted-by":"crossref","unstructured":"Berman, O., Ingco, D.I., Odoni, A.: Improving the location of minsum facilities through network modification. Ann. Oper. Res. 40, 1\u201316 (1992)","DOI":"10.1007\/BF02060467"},{"key":"9265_CR2","doi-asserted-by":"crossref","first-page":"1623","DOI":"10.1002\/net.20115","volume":"48","author":"ER Burkard","year":"2006","unstructured":"Burkard, E.R., Gassner, E., Hatzl, J.: A linear time algorithm for the reverse 1-median problem on a cycle. Networks 48, 1623 (2006)","journal-title":"Networks"},{"key":"9265_CR3","doi-asserted-by":"crossref","first-page":"1963","DOI":"10.1016\/j.dam.2007.04.005","volume":"156","author":"ER Burkard","year":"2008","unstructured":"Burkard, E.R., Gassner, E., Hatzl, J.: Reverse 2-median problem on trees. Discret. Appl. Math. 156, 1963\u20131976 (2008)","journal-title":"Discret. Appl. Math."},{"key":"9265_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.disopt.2004.03.003","volume":"1","author":"RE Burkard","year":"2004","unstructured":"Burkard, R.E., Pleschiutschnig, C., Zhang, J.: Inverse median problems. Discret. Optim. 1, 23\u201339 (2004)","journal-title":"Discret. Optim."},{"key":"9265_CR5","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.disopt.2006.11.008","volume":"5","author":"RE Burkard","year":"2009","unstructured":"Burkard, R.E., Pleschiutschnig, C., Zhang, J.: Inverse median problem on a cycle. Discret. Optim. 5, 242\u2013253 (2009)","journal-title":"Discret. Optim."},{"key":"9265_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00186-011-0346-5","volume":"73","author":"F Baroughi","year":"2011","unstructured":"Baroughi, F., Burkard, R.E., Gassner, E.: Inverse p-median problems with variable edge lengths. Math. Meth. Oper. Res. 73, 263\u2013280 (2011)","journal-title":"Math. Meth. Oper. Res."},{"issue":"1","key":"9265_CR7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.ejor.2010.01.046","volume":"206","author":"RE Burkard","year":"2010","unstructured":"Burkard, R.E., Galavii, M., Gassner, E.: The inverse fermat-weber problem. Eur. J. Oper. Res. 206(1), 11\u201317 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9265_CR8","doi-asserted-by":"crossref","unstructured":"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 .","DOI":"10.1080\/02331934.2013.783033"},{"key":"9265_CR9","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Oper. Res. 28, 1130\u20131154 (1980)","journal-title":"Oper. Res."},{"key":"9265_CR10","unstructured":"Mirchandani, P., Francis, R.: Discrete Location Theory. Wiley (1990)"},{"key":"9265_CR11","doi-asserted-by":"crossref","unstructured":"Fulkerson, D.R., Harding, G.C.: Maximizing the minimum source-sink path subject to a budget constraint. Math. Program. 13, 116\u2013118 (1977)","DOI":"10.1007\/BF01584329"},{"key":"9265_CR12","doi-asserted-by":"crossref","unstructured":"Hambrusch, S.E., Tu, H.-Y.: Edge weight reduction problems in directed acyclic graphs. J. Algoritm. 24(1), 66\u201393 (1997)","DOI":"10.1006\/jagm.1997.0856"},{"key":"9265_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013785 (1993)","DOI":"10.1145\/167088.167286"},{"key":"9265_CR14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0304-3975(97)00290-9","volume":"203","author":"KU Dragmeister","year":"1998","unstructured":"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\u2013121 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9265_CR15","doi-asserted-by":"crossref","unstructured":"Frederickson G.N., Solis-Oba R.: Increasing the weight of minimum spanning trees. J. Algorithm. 33(2), 244\u2013266 (1999)","DOI":"10.1006\/jagm.1999.1026"},{"key":"9265_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1009798010579","volume":"2","author":"SO Krumke","year":"1998","unstructured":"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\u2013288 (1998)","journal-title":"J. Comb. Optim."},{"key":"9265_CR17","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.ejor.2008.09.013","volume":"198","author":"E Gassner","year":"2008","unstructured":"Gassner, E.: Up- and downgrading the 1-center in a network. Eur. J. Oper. Res. 198, 370\u2013377 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9265_CR18","unstructured":"Gassner, E.: Up- and downgrading the 1-median in a network. Technical Report 2007-16, Graz University of Technology"}],"container-title":["Journal of Mathematical Modelling and Algorithms in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-014-9265-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-014-9265-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-014-9265-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:26:34Z","timestamp":1559255194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-014-9265-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9265"],"URL":"https:\/\/doi.org\/10.1007\/s10852-014-9265-9","relation":{},"ISSN":["2214-2487","2214-2495"],"issn-type":[{"value":"2214-2487","type":"print"},{"value":"2214-2495","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,2]]}}}