{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T19:37:10Z","timestamp":1778009830981,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,1,14]],"date-time":"2024-01-14T00:00:00Z","timestamp":1705190400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,14]],"date-time":"2024-01-14T00:00:00Z","timestamp":1705190400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471073"],"award-info":[{"award-number":["11471073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10957-023-02362-6","type":"journal-article","created":{"date-parts":[[2024,1,14]],"date-time":"2024-01-14T14:02:03Z","timestamp":1705240923000},"page":"524-554","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Inverse Vertex\/Absolute Quickest 1-Center Location Problem on a Tree Under Weighted $$l_1$$ Norm"],"prefix":"10.1007","volume":"200","author":[{"given":"Xinqiang","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-1868","authenticated-orcid":false,"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junhua","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"key":"2362_CR1","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1002\/net.20427","volume":"58","author":"B Alizadeh","year":"2011","unstructured":"Alizadeh, B., Burkard, R.E.: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58, 190\u2013200 (2011)","journal-title":"Networks"},{"key":"2362_CR2","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10100-012-0248-5","volume":"21","author":"B Alizadeh","year":"2012","unstructured":"Alizadeh, B., Burkard, R.E.: A linear time algorithm for inverse obnoxious center location problems on networks. Cent. Eur. J. Oper. Res. 21, 585\u2013594 (2012)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"2362_CR3","doi-asserted-by":"publisher","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.Z.: Inverse median problems. Discret. Optim. 1, 23\u201339 (2004)","journal-title":"Discret. Optim."},{"key":"2362_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1008360312607","volume":"15","author":"MC Cai","year":"1999","unstructured":"Cai, M.C., Yang, X.G., Zhang, J.Z.: The complexity analysis of the inverse center location problem. J. Glob. Optim. 15, 213\u2013218 (1999)","journal-title":"J. Glob. Optim."},{"key":"2362_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"YL Chen","year":"1990","unstructured":"Chen, Y.L., Chin, Y.H.: The quickest path problem. Comput. Oper. Res. 17, 153\u2013161 (1990)","journal-title":"Comput. Oper. Res."},{"key":"2362_CR6","volume-title":"Network and discrete location: models, algorithms, and applications","author":"MS Daskin","year":"2011","unstructured":"Daskin, M.S.: Network and discrete location: models, algorithms, and applications. Wiley, Hoboken (2011)"},{"key":"2362_CR7","doi-asserted-by":"crossref","unstructured":"Garrett, S.J.: Introductory numerical methods. In: Introduction to Actuarial and Financial Mathematical Methods. Academic. Press. pp. 411\u2013463 (2015)","DOI":"10.1016\/B978-0-12-800156-1.00013-3"},{"key":"2362_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10878-007-9098-9","volume":"16","author":"E Gassner","year":"2008","unstructured":"Gassner, E.: The inverse 1-maxian problem with edge length modification. J. Comb. Optim. 16, 50\u201367 (2008)","journal-title":"J. Comb. Optim."},{"key":"2362_CR9","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s41980-021-00536-4","volume":"48","author":"M Ghiyasvand","year":"2022","unstructured":"Ghiyasvand, M., Keshtkar, I.: Solving the absolute 1-center problem in the quickest path case. Bull. Iran. Math. Soc. 48, 643\u2013671 (2022)","journal-title":"Bull. Iran. Math. Soc."},{"issue":"1","key":"2362_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-011-9742-x","volume":"54","author":"XC Guan","year":"2012","unstructured":"Guan, X.C., Zhang, B.W.: Inverse 1-median problem on trees under weighted Hamming distance. J. Glob. Optim. 54(1), 75\u201382 (2012)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"2362_CR11","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450\u2013459 (1964)","journal-title":"Oper. Res."},{"issue":"3","key":"2362_CR12","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.: Minimax location of a facility in an undirected tree graph. Transp. Sci. 7(3), 287\u2013293 (1973)","journal-title":"Transp. Sci."},{"key":"2362_CR13","doi-asserted-by":"publisher","DOI":"10.1080\/02331934","author":"B Hasanzadeh","year":"2022","unstructured":"Hasanzadeh, B., Alizadeh, B., Baroughi, F.: Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks. Optimization (2022). https:\/\/doi.org\/10.1080\/02331934","journal-title":"Optimization"},{"key":"2362_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.dam.2019.01.001","volume":"260","author":"I Keshtkar","year":"2019","unstructured":"Keshtkar, I., Ghiyasvand, M.: Inverse quickest center location problem on a tree. Discret. Appl. Math. 260, 188\u2013202 (2019)","journal-title":"Discret. Appl. Math."},{"key":"2362_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0167-6377(97)00008-4","volume":"20","author":"EQV Martins","year":"1997","unstructured":"Martins, E.Q.V., Santos, J.L.E.: An algorithm for the quickest path problem. Oper. Res. Lett. 20, 195\u2013198 (1997)","journal-title":"Oper. Res. Lett."},{"key":"2362_CR16","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1007\/s00500-021-06463-0","volume":"26","author":"S Mohammadi","year":"2022","unstructured":"Mohammadi, S., Alizadeh, B., Baroughi, F., Afrashteh, E.: A modified directional bat algorithm for extensive inverse p-facility maxian location problems on networks. Soft. Comput. 26, 1941\u20131959 (2022)","journal-title":"Soft. Comput."},{"key":"2362_CR17","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/s10957-015-0829-2","volume":"168","author":"KT Nguyen","year":"2016","unstructured":"Nguyen, K.T.: Inverse 1-median problem on block graphs with variable vertex weights. J. Optim. Theory Appl. 168, 944\u2013957 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2362_CR18","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2015.06.064","volume":"247","author":"KT Nguyen","year":"2015","unstructured":"Nguyen, K.T., Chassein, A.: The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance. Eur. J. Oper. Res. 247(3), 774\u2013781 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"2362_CR19","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1080\/02331934.2019.1571056","volume":"68","author":"KT Nguyen","year":"2019","unstructured":"Nguyen, K.T., Hung, N.T., Nguyen-Thu, H., Le, T.T., Pham, V.H.: On some inverse 1-center location problems. Optimization 68(5), 999\u20131015 (2019)","journal-title":"Optimization"},{"issue":"3","key":"2362_CR20","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1007\/s10878-015-9907-5","volume":"32","author":"KT Nguyen","year":"2016","unstructured":"Nguyen, K.T., Sepasian, A.R.: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance. J. Comb. Optim. 32(3), 872\u2013884 (2016)","journal-title":"J. Comb. Optim."},{"key":"2362_CR21","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10898-022-01212-5","volume":"85","author":"XQ Qian","year":"2023","unstructured":"Qian, X.Q., Guan, X.C., Jia, J.H., Zhang, Q., Pardalos, P.M.: Vertex quickest 1-center location problem on trees and its inverse problem under weighted $$l_\\infty $$ norm. J. Glob. Optim. 85, 461\u2013485 (2023)","journal-title":"J. Glob. Optim."},{"key":"2362_CR22","doi-asserted-by":"crossref","unstructured":"Qian, X.Q., Guan, X.C., Jia, J.H., Zhang, Q., Pardalos, P.M.: The absolute quickest 1-center location problem on trees and its inverse problem under weighted $$l_{\\infty }$$ norm. Submitted to Optimization. (2022)","DOI":"10.1007\/s10898-022-01212-5"},{"key":"2362_CR23","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., Baroughi, F., Alizadeh, B.: The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion. Inform. Sci. 506, 383\u2013394 (2020)","journal-title":"Inform. Sci."},{"issue":"3","key":"2362_CR24","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1080\/02331934.2021.1995730","volume":"72","author":"J Tayyebi","year":"2021","unstructured":"Tayyebi, J., Sepasian, A.R.: Reverse 1-centre problem on trees under convex piecewise-linear cost function. Optimization 72(3), 843\u2013860 (2021)","journal-title":"Optimization"},{"issue":"4","key":"2362_CR25","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s11424-008-9142-6","volume":"21","author":"XG Yang","year":"2008","unstructured":"Yang, X.G., Zhang, J.Z.: Inverse center location problem on a tree. J. Syst. Sci. Complex 21(4), 651\u2013664 (2008)","journal-title":"J. Syst. Sci. Complex"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02362-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02362-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02362-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T13:16:23Z","timestamp":1706706983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02362-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,14]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["2362"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02362-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,14]]},"assertion":[{"value":"17 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}