{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:02Z","timestamp":1759847522536},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,24]],"date-time":"2015-05-24T00:00:00Z","timestamp":1432425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10878-015-9907-5","type":"journal-article","created":{"date-parts":[[2015,5,23]],"date-time":"2015-05-23T00:35:56Z","timestamp":1432341356000},"page":"872-884","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance"],"prefix":"10.1007","volume":"32","author":[{"given":"Kien Trung","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Reza","family":"Sepasian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,24]]},"reference":[{"issue":"3","key":"9907_CR1","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1002\/net.20427","volume":"58","author":"B Alizadeh","year":"2011","unstructured":"Alizadeh B, Burkard Rainer E (2011) Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58(3):190\u2013200","journal-title":"Networks"},{"key":"9907_CR2","doi-asserted-by":"crossref","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":"9907_CR3","doi-asserted-by":"crossref","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":"9907_CR4","doi-asserted-by":"crossref","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 Methods Oper Res 73:263\u2013280","journal-title":"Math Methods Oper Res"},{"key":"9907_CR5","doi-asserted-by":"crossref","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 problems. Discret Optim 1:23\u201339","journal-title":"Discret Optim"},{"key":"9907_CR6","doi-asserted-by":"crossref","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 problem on a cycle. Discret Optim 5:242\u2013253","journal-title":"Discret Optim"},{"key":"9907_CR7","doi-asserted-by":"crossref","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 inverse center location problem. J Glob Optim 15:213\u2013218","journal-title":"J Glob Optim"},{"key":"9907_CR8","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":"9907_CR9","doi-asserted-by":"crossref","first-page":"370377","DOI":"10.1016\/j.ejor.2008.09.013","volume":"198","author":"E Gassner","year":"2009","unstructured":"Gassner E (2009) Up- and downgrading the 1-center in a network. Eur J Oper Res 198:370377","journal-title":"Eur J Oper Res"},{"key":"9907_CR10","doi-asserted-by":"crossref","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":"9907_CR11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10898-011-9742-x","volume":"54","author":"X Guan","year":"2012","unstructured":"Guan X, Zhang B (2012) Inverse 1-median problem on trees under weighted Hamming distance. J Glob Optim 54:75\u201382","journal-title":"J Glob Optim"},{"key":"9907_CR12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. Part I: p-centers. Siam J Appl Math 37:539\u2013560","journal-title":"Siam J Appl Math"},{"key":"9907_CR13","unstructured":"Love RF, Morris JG, Wesolowsky GO (1988) Facilities location: models and methods. Elsevier Science Publishing Co., New York"},{"key":"9907_CR14","unstructured":"Nguyen KT (2014) Inverse location theory with ordered median function and other extensions. PhD Thesis, Kaiserslautern University, Germany"},{"key":"9907_CR15","doi-asserted-by":"publisher","unstructured":"Nguyen KT, Anh LQ (2015) Inverse $$k$$ k -centrum problem on trees with variable vertex weights. Math Meth Oper Res. doi: 10.1007\/s00186-015-0502-4","DOI":"10.1007\/s00186-015-0502-4"},{"key":"9907_CR16","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2014.994626","author":"KT Nguyen","year":"2015","unstructured":"Nguyen KT (2015) Reverse 1-center problem on weighted trees. Optimization. doi: 10.1080\/02331934.2014.994626","journal-title":"Optimization"},{"key":"9907_CR17","doi-asserted-by":"publisher","unstructured":"Nguyen KT, Chassein A (2014) Inverse eccentric vertex problem on networks. Cent Eur J Oper Res. doi: 10.1007\/s10100-014-0367-2","DOI":"10.1007\/s10100-014-0367-2"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9907-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9907-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9907-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:26Z","timestamp":1559262206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9907-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,24]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9907"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9907-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,24]]}}}