{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:47Z","timestamp":1774421327838,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T00:00:00Z","timestamp":1726790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T00:00:00Z","timestamp":1726790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Vietnam National University HoChiMinh City","award":["B2024-20-01"],"award-info":[{"award-number":["B2024-20-01"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10287-024-00522-1","type":"journal-article","created":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T19:01:39Z","timestamp":1726858899000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Some robust inverse median problems on trees with interval costs"],"prefix":"10.1007","volume":"21","author":[{"given":"Le Xuan","family":"Dai","sequence":"first","affiliation":[]},{"given":"Kien Trung","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Le Phuong","family":"Thao","sequence":"additional","affiliation":[]},{"given":"Pham Thi","family":"Vui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,20]]},"reference":[{"key":"522_CR1","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1002\/net.20427","volume":"58","author":"B Alizadeh","year":"2011","unstructured":"Alizadeh B, Burkard RE (2011) Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58:190\u2013200","journal-title":"Networks"},{"key":"522_CR2","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1016\/j.dam.2011.01.009","volume":"159","author":"B Alizadeh","year":"2011","unstructured":"Alizadeh B, Burkard RE (2011) Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discret Appl Math 159:706\u2013716","journal-title":"Discret Appl Math"},{"key":"522_CR3","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 RE, Pferschy U (2009) Inverse 1-center location problems with edge length augmentation on trees. Computing 86:331\u2013343","journal-title":"Computing"},{"key":"522_CR4","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, Bonab FB (2018) Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks. J Optim Theory Appl 178:914\u2013934","journal-title":"J Optim Theory Appl"},{"key":"522_CR5","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 problems with variable edge lengths. Math Meth Oper Res 73:263\u2013280","journal-title":"Math Meth Oper Res"},{"key":"522_CR6","doi-asserted-by":"crossref","unstructured":"Boyd S, Vandenberghe L (2004) Convex Optimization, Cambridge University Press","DOI":"10.1017\/CBO9780511804441"},{"key":"522_CR7","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 JZ (2004) Inverse median problems. Discret Optim 1:23\u201339","journal-title":"Discret Optim"},{"key":"522_CR8","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 JZ (2008) The inverse 1-median problem on a cycle. Discret Optim 5:242\u2013253","journal-title":"Discret Optim"},{"key":"522_CR9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1008360312607","volume":"15","author":"MC Cai","year":"1999","unstructured":"Cai MC, Yang XG, Zhang JZ (1999) The complexity analysis of the inverse center location problem. J Glob Optim 15:213\u2013218","journal-title":"J Glob Optim"},{"key":"522_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2017.06.042","volume":"264","author":"A Chassein","year":"2018","unstructured":"Chassein A, Goerigk M (2018) Variable-sized uncertainty and inverse problems in robust optimization. Euro J Oper Res 264:17\u201328","journal-title":"Euro J Oper Res"},{"key":"522_CR11","volume-title":"Facility Location: Applications and Theory","author":"Z Drezner","year":"2004","unstructured":"Drezner Z, Hamacher HW (2004) Facility Location: Applications and Theory. Springer, Berlin"},{"key":"522_CR12","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1016\/j.endm.2010.05.157","volume":"36","author":"M Galavii","year":"2010","unstructured":"Galavii M (2010) The inverse 1-median problem on a tree and on a path. Electron Notes Discret Math 36:1241\u20131248","journal-title":"Electron Notes Discret Math"},{"key":"522_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10878-010-9353-3","volume":"23","author":"E Gassner","year":"2012","unstructured":"Gassner E (2012) An inverse approach to convex ordered median problems in trees. J Comb Optim 23:261\u2013273","journal-title":"J Comb Optim"},{"key":"522_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10878-007-9098-9","volume":"16","author":"E Gassner","year":"2008","unstructured":"Gassner E (2008) The inverse 1-maxian problem with edge length modification. J Comb Optim 16:50\u201367","journal-title":"J Comb Optim"},{"key":"522_CR15","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.orl.2018.03.007","volume":"46","author":"K Ghobadi","year":"2018","unstructured":"Ghobadi K, Lee T, Mahmoudzadeh H, Terekhov D (2018) Robust inverse optimization. Oper Res Lett 46:339\u2013344","journal-title":"Oper Res Lett"},{"key":"522_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"AJ Goldman","year":"1971","unstructured":"Goldman AJ (1971) Optimal center location in simple networks. Transp Sci 5:539\u2013560","journal-title":"Transp Sci"},{"key":"522_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-011-9742-x","volume":"54","author":"X Guan","year":"2011","unstructured":"Guan X, Zhang B (2011) Inverse 1-median problem on trees under weighted Hamming distance. J Glob Opt 54:75\u201382","journal-title":"J Glob Opt"},{"key":"522_CR18","doi-asserted-by":"crossref","unstructured":"Hamacher HW (1995) Mathematische L$$\\ddot{\\text{o}}$$sungsverfahren f$$\\ddot{\\text{ u }}$$r planare Standortprobleme, Vieweg and Teubner.(In German)","DOI":"10.1007\/978-3-663-01968-8_4"},{"key":"522_CR19","first-page":"539","volume":"2","author":"LK Hua","year":"1962","unstructured":"Hua LK (1962) Application of mathematical models to wheat harvesting. Chin Math 2:539\u2013560","journal-title":"Chin Math"},{"key":"522_CR20","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algoithmic approach to network location problems. I: The p-centers. SIAM J Appl Math 37:513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"522_CR21","first-page":"536","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algoithmic approach to network location problems. II: The p-medians. SIAM J Appl Math 37:536\u2013560","journal-title":"SIAM J Appl Math"},{"key":"522_CR22","volume-title":"Uncertainty Theory","author":"B Liu","year":"2007","unstructured":"Liu B (2007) Uncertainty Theory, 2nd edn. Springer-Verlag, Berlin","edition":"2"},{"key":"522_CR23","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/s10957-015-0829-2","volume":"3","author":"KT Nguyen","year":"2016","unstructured":"Nguyen KT (2016) Inverse 1-median problem on block graphs with variable vertex weights. J Optim Theory Appl 3:944\u2013957","journal-title":"J Optim Theory Appl"},{"key":"522_CR24","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10100-017-0509-4","volume":"27","author":"KT Nguyen","year":"2019","unstructured":"Nguyen KT (2019) The inverse 1-center problem on cycles with variable edge lengths. CEJOR 27:263\u2013274","journal-title":"CEJOR"},{"key":"522_CR25","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 problem on trees under uncertain costs. Opuscula Math 36:513\u2013523","journal-title":"Opuscula Math"},{"key":"522_CR26","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s40306-018-0286-8","volume":"44","author":"KT Nguyen","year":"2019","unstructured":"Nguyen KT, Nguyen-Thu H, Hung NT (2019) Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees. Acta Mathematica Vietnamica 44:813\u2013831","journal-title":"Acta Mathematica Vietnamica"},{"key":"522_CR27","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1080\/02331934.2019.1571056","volume":"68","author":"KT Nguyen","year":"2019","unstructured":"Nguyen KT, Hung NT, Nguyen-Thu H, Pham VH (2019) On some inverse 1-center location problems. Optimization 68:999\u20131015","journal-title":"Optimization"},{"key":"522_CR28","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.11650\/tjm.20.2016.6296","volume":"20","author":"KT Nguyen","year":"2016","unstructured":"Nguyen KT, Vui PT (2016) The inverse $$p$$-maxian problem on trees with variable edge lengths. Taiwan J Math 20:1437\u20131449","journal-title":"Taiwan J Math"},{"key":"522_CR29","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00186-015-0502-4","volume":"82","author":"KT Nguyen","year":"2015","unstructured":"Nguyen KT, Anh LQ (2015) Inverse $$k$$-centrum problem on trees with variable vertex weights. Math Meth Oper Res 82:19\u201330","journal-title":"Math Meth Oper Res"},{"key":"522_CR30","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2015.06.064","volume":"247","author":"KT Nguyen","year":"2015","unstructured":"Nguyen KT, Chassein A (2015) The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance. Euro J Oper Res 247:774\u2013781","journal-title":"Euro J Oper Res"},{"key":"522_CR31","doi-asserted-by":"publisher","first-page":"221","DOI":"10.3934\/jimo.2019108","volume":"17","author":"KT Nguyen","year":"2021","unstructured":"Nguyen KT, Hieu VNM, Pham VH (2021) Inverse group 1-median problem on trees. J Indus Manag Optim 17:221\u2013232","journal-title":"J Indus Manag Optim"},{"key":"522_CR32","volume":"407","author":"KT Nguyen","year":"2021","unstructured":"Nguyen KT, Hung NT (2021) The minmax regret inverse maximum weight problem. Appl Math Comput 407:126328","journal-title":"Appl Math Comput"},{"key":"522_CR33","doi-asserted-by":"publisher","first-page":"7843","DOI":"10.1007\/s00500-018-3416-2","volume":"23","author":"A Soltanpour","year":"2019","unstructured":"Soltanpour A, Bonab FB, 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":"522_CR34","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ins.2019.08.018","volume":"506","author":"A Soltanpour","year":"2020","unstructured":"Soltanpour A, Bonab FB, Alizadeh B (2020) The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion. Inf Sci 506:383\u2013394","journal-title":"Inf Sci"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-024-00522-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-024-00522-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-024-00522-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T01:02:56Z","timestamp":1734051776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-024-00522-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,20]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["522"],"URL":"https:\/\/doi.org\/10.1007\/s10287-024-00522-1","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,20]]},"assertion":[{"value":"16 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2024","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 have no Conflict of interest to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"42"}}