{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T20:05:01Z","timestamp":1785441901828,"version":"3.56.0"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science & Technology Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.disopt.2026.100957","type":"journal-article","created":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T20:09:07Z","timestamp":1785355747000},"page":"100957","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The inverse 1-median problem on median graphs under l2-norm"],"prefix":"10.1016","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7522-4557","authenticated-orcid":false,"given":"Kien Trung","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0675-5196","authenticated-orcid":false,"given":"Nguyen Thanh","family":"Hung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2389-9437","authenticated-orcid":false,"given":"Nguyen Thanh","family":"Luan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9716-2820","authenticated-orcid":false,"given":"Cao Minh","family":"Quang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.disopt.2026.100957_b1","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","article-title":"Inverse optimization","volume":"49","author":"Ahuja","year":"2001","journal-title":"Oper. Res."},{"key":"10.1016\/j.disopt.2026.100957_b2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","article-title":"On an instance of the inverse shortest paths problem","volume":"53","author":"Burton","year":"1992","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.disopt.2026.100957_b3","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.ejor.2007.04.031","article-title":"The partial inverse minimum spanning tree problem when weight increase is forbidden","volume":"188","author":"Cai","year":"2008","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.disopt.2026.100957_b4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.10048","article-title":"Combinatorial algorithms for inverse network flow problems","volume":"40","author":"Ahuja","year":"2002","journal-title":"Networks"},{"key":"10.1016\/j.disopt.2026.100957_b5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","article-title":"Inverse combinatorial optimization: A survey on problems, methods, and results","volume":"8","author":"Heuberger","year":"2004","journal-title":"J. Comb. Optim."},{"issue":"2","key":"10.1016\/j.disopt.2026.100957_b6","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1287\/opre.2022.0382","article-title":"Inverse optimization: Theory and applications","volume":"73","author":"Chan","year":"2025","journal-title":"Oper. Res."},{"key":"10.1016\/j.disopt.2026.100957_b7","series-title":"Inverse Combinatorial Optimization Problems","author":"Guan","year":"2025"},{"key":"10.1016\/j.disopt.2026.100957_b8","series-title":"Facility Location: Applications and Theory","author":"Drezner","year":"2004"},{"key":"10.1016\/j.disopt.2026.100957_b9","series-title":"Operations Research and Decision Aid Methodologies in Traffic and Transportation Management","article-title":"Facility location: models, methods and applications","volume":"vol. 166","author":"Labb\u00e9","year":"1998"},{"issue":"3","key":"10.1016\/j.disopt.2026.100957_b10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1002\/net.20427","article-title":"Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees","volume":"58","author":"Alizadeh","year":"2011","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.disopt.2026.100957_b11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1008360312607","article-title":"The complexity analysis of the inverse center location problem","volume":"15","author":"Cai","year":"1999","journal-title":"J. Global Optim."},{"key":"10.1016\/j.disopt.2026.100957_b12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.tcs.2021.02.026","article-title":"The cardinality constrained inverse center location problems on tree networks with edge length augmentation","volume":"865","author":"Hasanzadeh","year":"2021","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.disopt.2026.100957_b13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10100-017-0509-4","article-title":"The inverse 1-center problem on cycles with variable edge lengths","volume":"27","author":"Nguyen","year":"2019","journal-title":"Central Eur. J. Oper. Res."},{"key":"10.1016\/j.disopt.2026.100957_b14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10878-010-9353-3","article-title":"An inverse approach to convex ordered median problems in trees","volume":"23","author":"Gassner","year":"2012","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10.1016\/j.disopt.2026.100957_b15","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.ejor.2015.06.064","article-title":"The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance","volume":"247","author":"Nguyen","year":"2015","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.disopt.2026.100957_b16","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.dam.2019.01.001","article-title":"Inverse quickest center location problem on a tree","volume":"260","author":"Keshtkar","year":"2019","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.disopt.2026.100957_b17","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1007\/s10957-023-02362-6","article-title":"Inverse vertex\/absolute quickest 1-center location problem on a tree under weighted l1- norm","volume":"200","author":"Qian","year":"2024","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"10.1016\/j.disopt.2026.100957_b18","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10898-022-01212-5","article-title":"Vertex quickest 1-center location problem on trees and its inverse problem under weighted l\u221e-norm","volume":"85","author":"Qian","year":"2023","journal-title":"J. Global Optim."},{"issue":"1","key":"10.1016\/j.disopt.2026.100957_b19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.disopt.2004.03.003","article-title":"Inverse median problems","volume":"1","author":"Burkard","year":"2004","journal-title":"Discrete Optim."},{"issue":"2","key":"10.1016\/j.disopt.2026.100957_b20","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.disopt.2006.11.008","article-title":"The inverse 1-median problem on a cycle","volume":"5","author":"Burkard","year":"2008","journal-title":"Discrete Optim."},{"issue":"1","key":"10.1016\/j.disopt.2026.100957_b21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.ejor.2010.01.046","article-title":"The inverse Fermat\u2013Weber problem","volume":"206","author":"Burkard","year":"2010","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.disopt.2026.100957_b22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10898-011-9742-x","article-title":"Inverse 1\u2013median problem on trees under weighted Hamming distance","volume":"54","author":"Guan","year":"2012","journal-title":"J. Global Optim."},{"issue":"3","key":"10.1016\/j.disopt.2026.100957_b23","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1007\/s10957-015-0829-2","article-title":"Inverse 1-median problem on block graphs with variable vertex weights","volume":"168","author":"Nguyen","year":"2016","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"10.1016\/j.disopt.2026.100957_b24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0217595918500306","article-title":"Linear time optimal approaches for max\u2013profit inverse 1\u2013median location problems","volume":"35","author":"Afrashteh","year":"2018","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"6","key":"10.1016\/j.disopt.2026.100957_b25","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1080\/10556788.2018.1482296","article-title":"Optimal algorithms for selective variants of the classical and inverse median location problems on trees","volume":"34","author":"Afrashteh","year":"2019","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.disopt.2026.100957_b26","article-title":"Budget constrained inverse median facility location problem on tree networks","volume":"375","author":"Alizadeh","year":"2020","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.disopt.2026.100957_b27","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.ins.2019.08.018","article-title":"The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion","volume":"506","author":"Soltanpour","year":"2020","journal-title":"Inform. Sci."},{"issue":"1","key":"10.1016\/j.disopt.2026.100957_b28","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3934\/jimo.2019108","article-title":"Inverse group 1-median problem on trees","volume":"17","author":"Nguyen","year":"2021","journal-title":"J. Ind. Manag. Optim."},{"issue":"13","key":"10.1016\/j.disopt.2026.100957_b29","doi-asserted-by":"crossref","first-page":"8821","DOI":"10.1007\/s00500-023-08042-x","article-title":"Fuzzy random classical and inverse median location problems","volume":"27","author":"Taghikhani","year":"2023","journal-title":"Soft Comput."},{"key":"10.1016\/j.disopt.2026.100957_b30","article-title":"The max\u2013sum inverse median location problem on trees with budget constraint","volume":"460","author":"Nguyen-Thu","year":"2024","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.disopt.2026.100957_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114574","article-title":"A hybrid modified PSO algorithm for the inverse p-median location problem in fuzzy random environment","volume":"1000","author":"Taghikhani","year":"2024","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.disopt.2026.100957_b32","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems. II: The p-medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.disopt.2026.100957_b33","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1090\/conm\/453\/08795","article-title":"Metric graph theory and geometry: a survey","volume":"453","author":"Bandelt","year":"2008","journal-title":"Contemp. Math."},{"key":"10.1016\/j.disopt.2026.100957_b34","article-title":"The interval function of a graph","volume":"vol. 132","author":"Mulder","year":"1980"},{"issue":"2","key":"10.1016\/j.disopt.2026.100957_b35","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1006\/aama.1999.0677","article-title":"Graphs of some CAT(0) complexes","volume":"24","author":"Chepoi","year":"2000","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/j.disopt.2026.100957_b36","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.jcss.2022.01.001","article-title":"Medians in median graphs and their cube complexes in linear time","volume":"126","author":"B\u00e9n\u00e9teau","year":"2022","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.disopt.2026.100957_b37","series-title":"Developments in Global Optimization","article-title":"Quadratic programming with box constraints","volume":"vol. 18","author":"De Angelis","year":"1997"}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000307?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000307?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T19:50:56Z","timestamp":1785441056000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528626000307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":37,"alternative-id":["S1572528626000307"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100957","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The inverse 1-median problem on median graphs under -norm","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100957","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"100957"}}