{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:49:19Z","timestamp":1769838559617,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T00:00:00Z","timestamp":1765929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T00:00:00Z","timestamp":1765929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00500-025-10961-w","type":"journal-article","created":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T10:44:19Z","timestamp":1765968259000},"page":"353-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A unified algorithm for inverse median facility location optimization on block graphs in uncertain environment"],"prefix":"10.1007","volume":"30","author":[{"given":"Roghayeh","family":"Etemad","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5726-2843","authenticated-orcid":false,"given":"Behrooz","family":"Alizadeh","sequence":"additional","affiliation":[]},{"given":"Somayeh","family":"Ahmadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,17]]},"reference":[{"key":"10961_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217595918500306","volume":"35","author":"E Afrashteh","year":"2018","unstructured":"Afrashteh E, Alizadeh B, Baroughi F, Nguyen KT (2018) Linear time optimal approaches for max-profit inverse 1-median location problems. Asia-Pacific J Oper Res 35:1\u201322","journal-title":"Asia-Pacific J Oper Res"},{"key":"10961_CR2","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1007\/s10957-018-1334-1","volume":"178","author":"E Afrashteh","year":"2018","unstructured":"Afrashteh E, Alizadeh B, Baroughi F, Nguyen KT (2018) Combinatorial algorithms for some variants of inverse obnoxious p-median location problem on tree networks. J Optim Theory Appl 178:914\u2013934","journal-title":"J Optim Theory Appl"},{"key":"10961_CR3","doi-asserted-by":"publisher","DOI":"10.10071\/s40305-018-0229-z","author":"E Afrashteh","year":"2018","unstructured":"Afrashteh E, Alizadeh B, Baroughi F (2018) Optimal algorithms for integer inverse undesirable p-median location problems on weighted extended star networks. Journal of the Operations Research Society of China. https:\/\/doi.org\/10.10071\/s40305-018-0229-z","journal-title":"Journal of the Operations Research Society of China"},{"key":"10961_CR4","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1080\/10556788.2018.1482296","volume":"34","author":"E Afrashteh","year":"2019","unstructured":"Afrashteh E, Alizadeh B, Baroughi F (2019) Optimal algorithms for selective variants of the classical and inverse median location problems on trees. Optimization Methods and Software 34:1213\u20131230","journal-title":"Optimization Methods and Software"},{"key":"10961_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10479-020-03561-4","volume":"289","author":"E Afrashteh","year":"2019","unstructured":"Afrashteh E, Alizadeh B, Baroughi F (2019) Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks. Ann Oper Res 289:153\u2013172","journal-title":"Ann Oper Res"},{"key":"10961_CR6","volume":"375","author":"B Alizadeh","year":"2020","unstructured":"Alizadeh B, Afrashteh E (2020) Budget-constrained inverse median facility location problem on tree networks. Appl Math Comput 375:125078","journal-title":"Appl Math Comput"},{"key":"10961_CR7","first-page":"78","volume":"10","author":"F Barough","year":"2019","unstructured":"Barough F, Soltanpour A, Alizadeh B (2019) A novel hybrid modified binary particle swarm optimization algorithm for the uncertain p-median location problem, Iranian Journal of. Oper Res 10:78\u201393","journal-title":"Oper Res"},{"key":"10961_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00186-011-0346-5","volume":"73","author":"FB Bonab","year":"2011","unstructured":"Bonab FB, Burkard RE, Gassner E (2011) Inverse p-median location problems with variable edge lengths. Math Methods Oper Res 73:263\u2013280","journal-title":"Math Methods Oper Res"},{"key":"10961_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph Theory. Springer, New York"},{"key":"10961_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.disopt.2004.03.003","volume":"1","author":"RE Burkard","year":"2004","unstructured":"Burkard RE, Pleschiutschnig C, Zhang J (2004) Inverse median location problems. Discret Optim 1:23\u201339","journal-title":"Discret Optim"},{"key":"10961_CR11","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.disopt.2006.11.008","volume":"5","author":"RE Burkard","year":"2008","unstructured":"Burkard RE, Pleschiutschnig C, Zhang J (2008) The inverse 1-median location problems on a cycle. Discret Optim 5:242\u2013253","journal-title":"Discret Optim"},{"key":"10961_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108482","volume":"171","author":"J Fathali","year":"2022","unstructured":"Fathali J (2022) A row generation method for the inverse continuous facility location problems. Comput Ind Eng 171:108482","journal-title":"Comput Ind Eng"},{"key":"10961_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.2298\/YJOR200715027G","volume":"32","author":"J Fathali","year":"2022","unstructured":"Fathali J, Gholami M (2022) The inverse minisum circle location problem. Yugoslav Journal of Operations Research 32:153\u2013165","journal-title":"Yugoslav Journal of Operations Research"},{"key":"10961_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-011-9742-x","volume":"54","author":"X Guan","year":"2012","unstructured":"Guan X, Zhang B (2012) Inverse median location problem on trees under weighted Hamming distance. J Global Optim 54:75\u201382","journal-title":"J Global Optim"},{"key":"10961_CR15","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi SL (1964) Optimum location of switching centers and the absolute centers and medians of a graph. Oper Res 12:450\u2013459","journal-title":"Oper Res"},{"key":"10961_CR16","first-page":"2569","volume":"28","author":"X Huang","year":"2015","unstructured":"Huang X, Hao D (2015) Modelling uncapacitated facility location problem with uncertain customers positions. Journal of Intelligent and Fuzzy Systems 28:2569\u20132577","journal-title":"Journal of Intelligent and Fuzzy Systems"},{"key":"10961_CR17","volume-title":"Uncertainty Theory","author":"B Liu","year":"2007","unstructured":"Liu B (2007) Uncertainty Theory, 2nd edn. Springer-Verlag, Berlin","edition":"2"},{"key":"10961_CR18","first-page":"3","volume":"3","author":"B Liu","year":"2009","unstructured":"Liu B (2009) Some research problems in uncertainty theory. Journal of Uncertain Systems 3:3\u201310","journal-title":"Journal of Uncertain Systems"},{"key":"10961_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13959-8","volume-title":"Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty","author":"B Liu","year":"2010","unstructured":"Liu B (2010) Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty. Springer-Verlag, Berlin"},{"key":"10961_CR20","first-page":"115","volume":"9","author":"M Nazari","year":"2018","unstructured":"Nazari M, Fathali J, Nazari M, Varedi-Koulaei SM (2018) Inverse of backup 2-median problems with variable edge lengths and vertex weights on trees and variable coordinates on the plane. Prod Oper Manag 9:115\u2013137","journal-title":"Prod Oper Manag"},{"key":"10961_CR21","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/s10957-015-0829-2","volume":"168","author":"KT Nguyen","year":"2016","unstructured":"Nguyen KT (2016) Inverse median location problem on block graphs with variable vertex weights. J Optim Theory Appl 168:944\u2013957","journal-title":"J Optim Theory Appl"},{"key":"10961_CR22","doi-asserted-by":"publisher","first-page":"513","DOI":"10.7494\/OpMath.2016.36.4.513","volume":"36","author":"KT Nguyen","year":"2016","unstructured":"Nguyen KT, Chi NTL (2016) A model for the inverse 1-median location problem on trees under uncertain costs. Opuscula Mathematica 36:513\u2013523","journal-title":"Opuscula Mathematica"},{"key":"10961_CR23","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10479-020-03651-3","volume":"292","author":"KT Nguyen","year":"2020","unstructured":"Nguyen KT, Hung NT (2020) The inverse connected p-median problem on block graphs under various cost functions. Ann Oper Res 292:97\u2013112","journal-title":"Ann Oper Res"},{"key":"10961_CR24","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s10845-014-0990-8","volume":"28","author":"Z Qin","year":"2017","unstructured":"Qin Z, Gao Y (2017) Uncapacitated p-hub location problem with fixed costs and uncertain flows. J Intell Manuf 28:705\u2013716","journal-title":"J Intell Manuf"},{"key":"10961_CR25","first-page":"595","volume":"64","author":"A Sepasian","year":"2015","unstructured":"Sepasian A, Rahbarnia F (2015) An $$O(n\\log n)$$ algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization 64:595\u2013602","journal-title":"Optimization"},{"key":"10961_CR26","first-page":"365","volume":"9","author":"A Soltanpour","year":"2017","unstructured":"Soltanpour A, Baroughi F, Alizadeh B (2017) Classical center location problem under uncertain environment. International Journal of Industrial Mathematic 9:365\u2013374","journal-title":"International Journal of Industrial Mathematic"},{"key":"10961_CR27","first-page":"383","volume":"506","author":"A Soltanpour","year":"2020","unstructured":"Soltanpour A, Baroughi F, Alizadeh B (2020) The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion, Information. Science 506:383\u2013394","journal-title":"Science"},{"key":"10961_CR28","doi-asserted-by":"publisher","first-page":"7843","DOI":"10.1007\/s00500-018-3416-2","volume":"23","author":"A Soltanpour","year":"2019","unstructured":"Soltanpour A, Baroughi F, Alizadeh B (2019) Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective. Soft Comput 23:7843\u20137852","journal-title":"Soft Comput"},{"key":"10961_CR29","doi-asserted-by":"publisher","first-page":"055","DOI":"10.22190\/FUMI2001055S","volume":"35","author":"A Soltanpour","year":"2020","unstructured":"Soltanpour A, Baroughi F, Alizadeh B (2020) A solution algorithm for p-median location problem on uncertain random networks. Facta Universitatis Series Mathematics and Informatics 35:055\u2013071","journal-title":"Facta Universitatis Series Mathematics and Informatics"},{"key":"10961_CR30","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.apm.2017.06.043","volume":"51","author":"B Zhang","year":"2017","unstructured":"Zhang B, Peng J, Li S (2017) Covering location problem of emergency service facilities in an uncertain environment. Appl Math Model 51:429\u2013447","journal-title":"Appl Math Model"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10961-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10961-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10961-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T15:54:45Z","timestamp":1769788485000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10961-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,17]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10961"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10961-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,17]]},"assertion":[{"value":"21 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts 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"}}]}}