{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:31Z","timestamp":1759063771321},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,11,4]],"date-time":"2014-11-04T00:00:00Z","timestamp":1415059200000},"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":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10100-014-0367-2","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T09:51:11Z","timestamp":1415008271000},"page":"687-698","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Inverse eccentric vertex problem on networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Kien T.","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Chassein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,4]]},"reference":[{"key":"367_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.10048","volume":"40","author":"RK Ahuja","year":"2002","unstructured":"Ahuja RK, Orlin JB (2002) Combinatorial algorithms for inverse network flow problems. Networks 40: 181\u2013187","journal-title":"Networks"},{"key":"367_CR2","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"RK Ahuja","year":"2001","unstructured":"Ahuja RK, Orlin JB (2001) Inverse optimization. Oper Res 49:771\u2013783","journal-title":"Oper Res"},{"key":"367_CR3","doi-asserted-by":"crossref","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:190\u2013200","journal-title":"Networks"},{"key":"367_CR4","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 (2011b) 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":"367_CR5","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":"367_CR6","first-page":"178","volume":"16","author":"M Bezad","year":"1976","unstructured":"Bezad M, Simpson JE (1976) Eccentric sequences and eccentric sets in graphs. Discret Math 16:178\u2013193","journal-title":"Discret Math"},{"key":"367_CR7","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 JZ (2004) Inverse median problems. Discret Optim 1:23\u201339","journal-title":"Discret Optim"},{"key":"367_CR8","unstructured":"Burton D (1993) Inverse shortest path problem. PhD thesis"},{"key":"367_CR9","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 the inverse center location problem. J Glob Optim 15:213\u2013218","journal-title":"J Glob Optim"},{"key":"367_CR10","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of $$NP$$ N P -completeness. W. H. Freeman and Co, New York"},{"key":"367_CR11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C Heuberger","year":"2004","unstructured":"Heuberger C (2004) Inverse combinatorial optimization: a survey on problems, methods, and results. J Comb Optim 8:329\u2013361","journal-title":"J Comb Optim"},{"key":"367_CR12","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1287\/opre.51.5.785.16756","volume":"51","author":"DS Hochbaum","year":"2003","unstructured":"Hochbaum DS (2003) Efficient algorithms for the inverse spanning-tree problem. Oper Res 51:785\u2013797","journal-title":"Oper Res"},{"key":"367_CR13","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems, I: the p-centers. SIAM J Appl Math 37:513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"367_CR14","doi-asserted-by":"crossref","unstructured":"Megiddo N (1983) Linear-time algorithms for linear programming in $$\\mathbb{R}^{3}$$ R 3 and related problems. SIAM J Comput 12:759\u2013776","DOI":"10.1137\/0212052"},{"key":"367_CR15","unstructured":"Mneimneh M, Sakallah K (2003) Computing vertex eccentricity in exponentially large graphs: QBF formulation and solution. In: Proceedings of 6th international conference SAT03, volume 2919 of LNCS"},{"key":"367_CR16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02351592","volume":"8","author":"KB Reid","year":"1992","unstructured":"Reid KB, Gu W (1992) Peripheral and eccentric vertices in graphs. Gr Comb 8:361\u2013375","journal-title":"Gr Comb"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0367-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0367-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0367-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:32Z","timestamp":1559123372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0367-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,4]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["367"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0367-2","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,4]]}}}