{"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":1778009830978,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T00:00:00Z","timestamp":1658016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T00:00:00Z","timestamp":1658016000000},"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"}]},{"DOI":"10.13039\/501100007251","name":"National Research University Higher School of Economics","doi-asserted-by":"publisher","award":["HSE"],"award-info":[{"award-number":["HSE"]}],"id":[{"id":"10.13039\/501100007251","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10898-022-01212-5","type":"journal-article","created":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T08:02:23Z","timestamp":1658044943000},"page":"461-485","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Vertex quickest 1-center location problem on trees and its inverse problem under weighted $$l_\\infty $$ norm"],"prefix":"10.1007","volume":"85","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":"Qiao","family":"Zhang","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":[[2022,7,17]]},"reference":[{"key":"1212_CR1","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.: Optimal algorithms for selective variants of the classical and inverse median location problems on trees. Optim. Method Softw. 34, 1213\u20131230 (2019)","journal-title":"Optim. Method Softw."},{"key":"1212_CR2","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":"1212_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ejor.2010.01.046","volume":"206","author":"RE Burkard","year":"2010","unstructured":"Burkard, R.E., Galavii, M., Gassner, E.: The inverse Fermat-Weber problem. Eur. J. Oper. Res. 206, 11\u201317 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1212_CR4","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. Discrete Optim. 1, 23\u201339 (2004)","journal-title":"Discrete Optim."},{"key":"1212_CR5","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":"1212_CR6","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10898-017-0546-5","volume":"69","author":"XC Guan","year":"2017","unstructured":"Guan, X.C., He, X.Y., Pardalos, P.M., Zhang, B.W.: Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector. J. Glob. Optim. 69, 911\u2013925 (2017)","journal-title":"J. Glob. Optim."},{"key":"1212_CR7","first-page":"1","volume":"5","author":"XC Guan","year":"2017","unstructured":"Guan, X.C., Pardalos, P.M., Zhang, B.W.: Inverse max+sum spanning tree problem under weighted $$l_1$$ norm by modifying the sum-cost vector. Optim. Lett. 5, 1\u201313 (2017)","journal-title":"Optim. Lett."},{"issue":"1","key":"1212_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10898-014-0140-z","volume":"61","author":"XC Guan","year":"2015","unstructured":"Guan, X.C., Pardalos, P.M., Zuo, X.: Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted $$l_\\infty $$ norm. J. Glob. Optim. 61(1), 165\u2013182 (2015)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1212_CR9","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":"1212_CR10","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":"1212_CR11","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":"1212_CR12","doi-asserted-by":"publisher","unstructured":"Jia, J.H., Guan, X.C., Zhang, Q., Qian, X.Q., Pardalos, P.M.: Inverse max+sum spanning tree problem under weighted $$l_{\\infty }$$ norm by modifying max-weight vector. J. Glob. Optim. https:\/\/doi.org\/10.1007\/s10898-022-01170-y (2022)","DOI":"10.1007\/s10898-022-01170-y"},{"key":"1212_CR13","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":"1212_CR14","first-page":"51","volume-title":"Facilities location: Models and methods","author":"RF Love","year":"1988","unstructured":"Love, R.F., Morris, J.G., Wesolowsky, G.O.: Facilities location: Models and methods, pp. 51\u201360. North-Holland, New York (1988)"},{"issue":"3","key":"1212_CR15","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":"4","key":"1212_CR16","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 Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01212-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01212-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01212-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T12:21:48Z","timestamp":1675340508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01212-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,17]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1212"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01212-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,17]]},"assertion":[{"value":"4 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}