{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T18:18:18Z","timestamp":1785953898360,"version":"3.56.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T00:00:00Z","timestamp":1583884800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T00:00:00Z","timestamp":1583884800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10479-020-03561-4","type":"journal-article","created":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T14:02:48Z","timestamp":1583935368000},"page":"153-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks"],"prefix":"10.1007","volume":"289","author":[{"given":"Esmaeil","family":"Afrashteh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Behrooz","family":"Alizadeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fahimeh","family":"Baroughi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,3,11]]},"reference":[{"key":"3561_CR1","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1007\/s10957-018-1334-1","volume":"178","author":"B Alizadeh","year":"2018","unstructured":"Alizadeh, B., Afrashteh, E., & Baroughi, F. (2018). Combinatorial algorithms for some variants of inverse obnoxious $$ p $$-median location problem on tree networks. Journal of Optimization Theory and Applications, 178, 914\u2013934.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3561_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2018.11.020","volume":"772","author":"B Alizadeh","year":"2019","unstructured":"Alizadeh, B., Afrashteh, E., & Baroughi, F. (2019). Inverse obnoxious $$ p $$-median location problems on trees with edge length modifications under different norms. Theoretical Computer Science, 772, 73\u201387.","journal-title":"Theoretical Computer Science"},{"key":"3561_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10100-012-0248-5","volume":"21","author":"B Alizadeh","year":"2013","unstructured":"Alizadeh, B., & Burkard, R. E. (2013). A linear time algorithm for inverse obnoxious center location problems on networks. Central European Journal of Operations Research, 21, 585\u2013594.","journal-title":"Central European Journal of Operations Research"},{"key":"3561_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00607-009-0070-7","volume":"86","author":"B Alizadeh","year":"2009","unstructured":"Alizadeh, B., Burkard, R. E., & Pferschy, U. (2009). Inverse 1-center location problems with edge length augmentation on trees. Computing, 86, 331\u2013343.","journal-title":"Computing"},{"key":"3561_CR5","doi-asserted-by":"publisher","first-page":"2025","DOI":"10.1080\/02331934.2016.1203915","volume":"65","author":"B Alizadeh","year":"2016","unstructured":"Alizadeh, B., & Etemad, R. (2016). Linear time optimal approaches for reverse obnoxious center location problems on networks. Optimization, 65, 2025\u20132036.","journal-title":"Optimization"},{"key":"3561_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2017.10.001","volume":"707","author":"B Alizadeh","year":"2018","unstructured":"Alizadeh, B., & Etemad, R. (2018). Optimal algorithms for inverse vertex obnoxious center location problems on graphs. Theoretical Computer Science, 707, 36\u201345.","journal-title":"Theoretical Computer Science"},{"key":"3561_CR7","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas, E., & Zemel, E. (1980). An algorithm for large zero-one knapsack problems. Operations Research, 28, 1130\u20131154.","journal-title":"Operations Research"},{"key":"3561_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.orl.2006.03.016","volume":"35","author":"RE Burkard","year":"2007","unstructured":"Burkard, R. E., Fathali, J., & Kakhki, H. T. (2007). The $$ p $$-maxian problem on a tree. Operations Research Letters, 35, 331\u2013335.","journal-title":"Operations Research Letters"},{"key":"3561_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0377-2217(02)00713-0","volume":"153","author":"RE Burkard","year":"2004","unstructured":"Burkard, R. E., Lin, Y., & Zhang, J. (2004). Weight reduction problems with certain bottleneck objectives. European Journal of Operational Research, 153, 191\u2013199.","journal-title":"European Journal of Operational Research"},{"key":"3561_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(03)00431-1","volume":"133","author":"P Cappanera","year":"2003","unstructured":"Cappanera, P., Gallo, G., & Maffioli, F. (2003). Discrete facility location and routing of obnoxious activities. Discrete Applied Mathematics, 133, 3\u201328.","journal-title":"Discrete Applied Mathematics"},{"key":"3561_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1002\/net.10055","volume":"41","author":"V Chepoi","year":"2003","unstructured":"Chepoi, V., Noltemeier, H., & Vaxes, Y. (2003). Upgrading trees under diameter and budget constraints. Networks, 41, 24\u201335.","journal-title":"Networks"},{"key":"3561_CR12","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to Algorithms (2nd ed.). Cambridge: MIT Press.","edition":"2"},{"key":"3561_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(97)00290-9","volume":"203","author":"KU Drangmeister","year":"1998","unstructured":"Drangmeister, K. U., Krumke, S. O., Marathe, M. V., Noltemeier, H., & Ravi, S. S. (1998). Modifying edges of a network to obtain short subgraphs. Theoretical Computer Science, 203, 91\u2013121.","journal-title":"Theoretical Computer Science"},{"key":"3561_CR14","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s40305-016-0144-0","volume":"5","author":"R Etemad","year":"2017","unstructured":"Etemad, R., & Alizadeh, B. (2017). Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs. Journal of the Operations Research Society of China, 5, 347\u2013361.","journal-title":"Journal of the Operations Research Society of China"},{"key":"3561_CR15","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00186-017-0624-y","volume":"87","author":"R Etemad","year":"2018","unstructured":"Etemad, R., & Alizadeh, B. (2018). Reverse selective obnoxious center location problems on tree graphs. Mathematical Methods of Operations Research, 87, 431\u2013450.","journal-title":"Mathematical Methods of Operations Research"},{"key":"3561_CR16","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1006\/jagm.1999.1026","volume":"33","author":"GN Frederickson","year":"1999","unstructured":"Frederickson, G. N., & Solis-Oba, R. (1999). Increasing the weight of minimum spanning trees. Journal of Algorithms, 33, 244\u2013266.","journal-title":"Journal of Algorithms"},{"key":"3561_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"DR Fulkerson","year":"1977","unstructured":"Fulkerson, D. R., & Harding, G. C. (1977). Maximizing the minimum source\u2013sink path subject to a budget constraint. Mathematical Programming, 13, 116\u2013118.","journal-title":"Mathematical Programming"},{"key":"3561_CR18","unstructured":"Gassner, E. (2007). Up- and downgrading the 1-median in a network, Technical report 2007\u20132016, Graz University of Technology"},{"key":"3561_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10878-007-9098-9","volume":"16","author":"E Gassner","year":"2008","unstructured":"Gassner, E. (2008a). The inverse 1-maxian problem with edge length modification. Journal of Combinatorial Optimization, 16, 50\u201367.","journal-title":"Journal of Combinatorial Optimization"},{"key":"3561_CR20","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.ejor.2008.09.013","volume":"198","author":"E Gassner","year":"2008","unstructured":"Gassner, E. (2008b). Up- and downgrading the 1-center in a network. European Journal of Operational Research, 198, 370\u2013377.","journal-title":"European Journal of Operational Research"},{"key":"3561_CR21","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10479-009-0641-1","volume":"172","author":"E Gassner","year":"2009","unstructured":"Gassner, E. (2009). A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric. Annals of Operations Research, 172, 393\u2013404.","journal-title":"Annals of Operations Research"},{"key":"3561_CR22","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"AJ Goldman","year":"1971","unstructured":"Goldman, A. J. (1971). Optimal center location in simple networks. Transportation Science, 5, 212\u2013221.","journal-title":"Transportation Science"},{"key":"3561_CR23","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.1997.0856","volume":"24","author":"SE Hambrusch","year":"1997","unstructured":"Hambrusch, S. E., & Tu, H. Y. (1997). Edge weight reduction problems in directed acyclic graphs. Journal of Algorithms, 24, 66\u201393.","journal-title":"Journal of Algorithms"},{"key":"3561_CR24","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"GY Handler","year":"1973","unstructured":"Handler, G. Y. (1973). Minimax location of a facility in an undirected tree graph. Transportation Science, 7, 287\u2013293.","journal-title":"Transportation Science"},{"key":"3561_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack Problems. Berlin: Springer."},{"key":"3561_CR26","doi-asserted-by":"publisher","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. (1998). Approximation algorithms for certain network improvement problems. Journal of Combinatorial Optimization, 2, 257\u2013288.","journal-title":"Journal of Combinatorial Optimization"},{"key":"3561_CR27","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.11650\/tjm.20.2016.6296","volume":"20","author":"KT Nguyen","year":"2016","unstructured":"Nguyen, K. T., & Vui, P. T. (2016). The invere $$ p $$-maxian problem on trees with variable edge lengths. Taiwanese Journal of Mathematics, 20, 1437\u20131449.","journal-title":"Taiwanese Journal of Mathematics"},{"key":"3561_CR28","first-page":"109","volume":"36","author":"F Plastria","year":"1996","unstructured":"Plastria, F. (1996). Optimal location of undesirable facilities: A selective overview. Belgian Journal of Operations Research, Statistics and Computer Science, 36, 109\u2013127.","journal-title":"Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"3561_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10479-014-1587-5","volume":"246","author":"F Plastria","year":"2016","unstructured":"Plastria, F. (2016). Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams. Annals of Operations Research, 246, 227\u2013251.","journal-title":"Annals of Operations Research"},{"key":"3561_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2018.02.002","volume":"29","author":"AR Sepasian","year":"2018","unstructured":"Sepasian, A. R. (2018). Upgrading the 1-center problem with edge length variables on a tree. Discrete Optimization, 29, 1\u201317.","journal-title":"Discrete Optimization"},{"key":"3561_CR31","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10852-014-9265-9","volume":"14","author":"AR Sepasian","year":"2015","unstructured":"Sepasian, A. R., & Rahbarnia, F. (2015). Upgrading $$ p $$-median problem on a path. Journal of Mathematical Modelling and Algorithms, 14, 145\u2013157.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"3561_CR32","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1287\/trsc.18.1.76","volume":"18","author":"SS Ting","year":"1984","unstructured":"Ting, S. S. (1984). A linear time algorithm for maxisum facility location on tree networks. Transportation Science, 18, 76\u201384.","journal-title":"Transportation Science"},{"key":"3561_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility Location: Concepts, Models, Algorithms and Case Studies","author":"R Zanjirani","year":"2009","unstructured":"Zanjirani, R., & Hekmatfar, M. (2009). Facility Location: Concepts, Models, Algorithms and Case Studies. Berlin: Physica-Verlag."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03561-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-020-03561-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03561-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:54:15Z","timestamp":1615424055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-020-03561-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,11]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["3561"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03561-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,11]]},"assertion":[{"value":"11 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}