{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T21:02:36Z","timestamp":1772744556237,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T00:00:00Z","timestamp":1511913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Vietnam National Foundation for Science and Technology Development","award":["101.01-2016.08"],"award-info":[{"award-number":["101.01-2016.08"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10100-017-0509-4","type":"journal-article","created":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T13:35:32Z","timestamp":1511962532000},"page":"263-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["The inverse 1-center problem on cycles with variable edge lengths"],"prefix":"10.1007","volume":"27","author":[{"given":"Kien Trung","family":"Nguyen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,29]]},"reference":[{"key":"509_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s12597-016-0296-z","author":"B Alizadeh","year":"2016","unstructured":"Alizadeh B, Bakhteh S (2016) A modified firefly algorithm for general inverse \n                              $$p$$\n                              \n                                 \n                                 \n                                    p\n                                 \n                              \n                              \n                           -median location problems under different distance norms. OPSEARCH. \n                              https:\/\/doi.org\/10.1007\/s12597-016-0296-z","journal-title":"OPSEARCH"},{"issue":"3","key":"509_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1002\/net.20427","volume":"58","author":"B Alizadeh","year":"2011","unstructured":"Alizadeh B, Burkard RE (2011a) Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58(3):190\u2013200. \n                              https:\/\/doi.org\/10.1002\/net.20427","journal-title":"Networks"},{"key":"509_CR3","doi-asserted-by":"publisher","unstructured":"Alizadeh B, Burkard RE (2011b) Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discrete Appl. Math. 159:706\u2013716. \n                              https:\/\/doi.org\/10.1016\/j.dam.2011.01.009","DOI":"10.1016\/j.dam.2011.01.009"},{"key":"509_CR4","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10100-012-0248-5","volume":"2013","author":"B Alizadeh","year":"2012","unstructured":"Alizadeh B, Burkard RE (2012) A linear time algorithm for inverse obnoxious center location problems on networks. Cent. Eur. J. Oper. Res. 2013:585\u2013594. \n                              https:\/\/doi.org\/10.1007\/s10100-012-0248-5","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"509_CR5","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. \n                              https:\/\/doi.org\/10.1007\/s00607-009-0070-7","journal-title":"Computing"},{"key":"509_CR6","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 \n                              $$p$$\n                              \n                                 \n                                 \n                                    p\n                                 \n                              \n                              \n                           -median problems with variable edge lengths. Math. Methods Oper. Res. 73:263\u2013280. \n                              https:\/\/doi.org\/10.1007\/s00186-011-0346-5","journal-title":"Math. Methods Oper. Res."},{"key":"509_CR7","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. Discrete Opt. 5:242\u2013253. \n                              https:\/\/doi.org\/10.1016\/j.disopt.2006.11.008","journal-title":"Discrete Opt."},{"key":"509_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.disopt.2004.03.003","volume":"1","author":"RE Burkard","year":"2014","unstructured":"Burkard RE, Pleschiutschnig C, Zhang JZ (2014) Inverse median problems. Discrete Opt. 1:23\u201339. \n                              https:\/\/doi.org\/10.1016\/j.disopt.2004.03.003","journal-title":"Discrete Opt."},{"key":"509_CR9","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 Disrete Math. 36:1241\u20131248. \n                              https:\/\/doi.org\/10.1016\/j.endm.2010.05.157","journal-title":"Electron. Notes Disrete Math."},{"issue":"2","key":"509_CR10","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. Opt. 23(2):261\u2013273. \n                              https:\/\/doi.org\/10.1007\/s10878-010-9353-3","journal-title":"J. Comb. Opt."},{"key":"509_CR11","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. \n                              https:\/\/doi.org\/10.1007\/s10898-011-9742-x","journal-title":"J. Glob. Opt."},{"key":"509_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979a) An algoithmic approach to network location problems, I. The p-centers. SIAM J. Appl. Math. 37:513\u2013538. \n                              https:\/\/doi.org\/10.1137\/0137040","journal-title":"SIAM J. Appl. Math."},{"key":"509_CR13","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979b) An algoithmic approach to network location problems, II. The p-medians. SIAM J. Appl. Math. 37:536\u2013560. \n                              https:\/\/doi.org\/10.1137\/0137041","journal-title":"SIAM J. Appl. Math."},{"key":"509_CR14","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/s10957-015-0829-2","volume":"168","author":"KT Nguyen","year":"2016","unstructured":"Nguyen KT (2016) Inverse 1-median problem on block graphs with variable vertex weights. J. Optim. Theory Appl. 168:944\u2013957. \n                              https:\/\/doi.org\/10.1007\/s10957-015-0829-2","journal-title":"J. Optim. Theory Appl."},{"key":"509_CR15","doi-asserted-by":"publisher","unstructured":"Nguyen KT, Anh LQ (2015) Inverse \n                              $$k$$\n                              \n                                 \n                                 \n                                    k\n                                 \n                              \n                              \n                           -centrum problem on trees with variable vertex weights. Math. Meth. Oper. Res. 82:19\u201330. \n                              https:\/\/doi.org\/10.1007\/s00186-015-0502-4","DOI":"10.1007\/s00186-015-0502-4"},{"key":"509_CR16","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10100-014-0367-2","volume":"23","author":"KT Nguyen","year":"2015","unstructured":"Nguyen KT, Chassein A (2015a) Inverse eccentric vertex problem on networks. Cent. Eur. J. Oper. Res. 23:687\u2013698. \n                              https:\/\/doi.org\/10.1007\/s10100-014-0367-2","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"509_CR17","doi-asserted-by":"publisher","unstructured":"Nguyen KT, Chassein A (2015b) The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance. Eur. J. Oper. Res. 247:774\u2013781. \n                              https:\/\/doi.org\/10.1016\/j.ejor.2015.06.064","DOI":"10.1016\/j.ejor.2015.06.064"},{"key":"509_CR18","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. \n                              https:\/\/doi.org\/10.7494\/OpMath.2016.36.4.513","journal-title":"Opuscula Math."},{"key":"509_CR19","doi-asserted-by":"publisher","unstructured":"Nguyen KT, Sepasian AR (2015) The inverse 1-center problem on trees under Chebyshev norm and Hamming distance. J. Comb. Opt. 32:872\u2013884. \n                              https:\/\/doi.org\/10.1007\/s10878-015-9907-5","DOI":"10.1007\/s10878-015-9907-5"},{"key":"509_CR20","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1080\/02331934.2013.783033","volume":"64","author":"AR Sepasian","year":"2015","unstructured":"Sepasian AR, Rahbarnia F (2015) An \n                              $$O(n\\log n)$$\n                              \n                                 \n                                 \n                                    \n                                       O\n                                       (\n                                       n\n                                       log\n                                       n\n                                       )\n                                    \n                                 \n                              \n                              \n                            algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization 64:595\u2013602. \n                              https:\/\/doi.org\/10.1080\/02331934.2013.783033","journal-title":"Optimization"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-017-0509-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0509-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0509-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T12:53:46Z","timestamp":1547124826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-017-0509-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,29]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["509"],"URL":"https:\/\/doi.org\/10.1007\/s10100-017-0509-4","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,29]]}}}