{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T21:02:33Z","timestamp":1772744553188,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,10,17]],"date-time":"2009-10-17T00:00:00Z","timestamp":1255737600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s00607-009-0070-7","type":"journal-article","created":{"date-parts":[[2009,10,16]],"date-time":"2009-10-16T11:17:07Z","timestamp":1255691827000},"page":"331-343","source":"Crossref","is-referenced-by-count":49,"title":["Inverse 1-center location problems with edge length augmentation on trees"],"prefix":"10.1007","volume":"86","author":[{"given":"Behrooz","family":"Alizadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer E.","family":"Burkard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,17]]},"reference":[{"key":"70_CR1","doi-asserted-by":"crossref","unstructured":"Alizadeh B, Burkard RE (2009) Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Technical Report 2009\u201309, Graz University of Technology","DOI":"10.1002\/net.20427"},{"key":"70_CR2","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problems. Oper Res 28: 1130\u20131154","journal-title":"Oper Res"},{"key":"70_CR3","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":"70_CR4","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.disopt.2006.11.008","volume":"5","author":"RE Burkard","year":"2007","unstructured":"Burkard RE, Pleschiutschnig C, Zhang J (2007) The inverse 1-median problem on a cycle. Discret Optim 5: 242\u2013253","journal-title":"Discret Optim"},{"key":"70_CR5","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 inverese center location problem. J Global Optim 15: 213\u2013218","journal-title":"J Global Optim"},{"key":"70_CR6","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge","edition":"2"},{"key":"70_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032343","volume-title":"Network and discrete location: modeles, algorithms and applications","author":"MS Daskin","year":"1995","unstructured":"Daskin MS (1995) Network and discrete location: modeles, algorithms and applications. Wiley, New York"},{"key":"70_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":"70_CR9","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/j.ejor.2004.07.059","volume":"170","author":"CW Duin","year":"2006","unstructured":"Duin CW, Volgenant A (2006) Some inverse optimization problems under the Hamming distance. Eur J Oper Res 170: 887\u2013899","journal-title":"Eur J Oper Res"},{"key":"70_CR10","volume-title":"Facility layout and location, an analytical approach","author":"RL Francis","year":"1992","unstructured":"Francis RL, McGinnis LF, White JA (1992) Facility layout and location, an analytical approach. Prentice Hall, Englewood Cliffs"},{"key":"70_CR11","unstructured":"Galavii M (2008) Inverse 1-median problems. Ph.D. Disseration, Graz University of Technology"},{"key":"70_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/s10878-007-9098-9","volume":"16","author":"E Gassner","year":"2007","unstructured":"Gassner E (2007) The inverse 1-maxian problem with edge length modification. J Comb Optim 16: 50\u201367","journal-title":"J Comb Optim"},{"key":"70_CR13","unstructured":"Gassner E (2008) An inverse approach to convex ordered median problems in trees. Technical Report 2008\u201316, Graz University of Technology"},{"key":"70_CR14","volume-title":"Data structures and algorithms in C++","author":"MT Goodrich","year":"2003","unstructured":"Goodrich MT, Tamassia R, Mount D (2003) Data structures and algorithms in C++. Wiley, New York"},{"key":"70_CR15","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/11775096_21","volume":"4041","author":"X Guan","year":"2006","unstructured":"Guan X, Zhang J (2006) Inverse bottleneck optimization problems on networks. Lect Notes Comput Sci 4041: 220\u2013230","journal-title":"Lect Notes Comput Sci"},{"key":"70_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"GY Handler","year":"1973","unstructured":"Handler GY (1973) Minimax location of a facility in an undirected tree graph. Transp Sci 7: 287\u2013293","journal-title":"Transp Sci"},{"key":"70_CR17","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":"70_CR18","volume-title":"Personal communication","author":"J Hatzl","year":"2006","unstructured":"Hatzl J (2006) Personal communication. Graz University of Technology, Graz"},{"key":"70_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"70_CR20","volume-title":"Discrete location theory","author":"BP Mirchandani","year":"1990","unstructured":"Mirchandani BP, Francis RL (1990) Discrete location theory. Wiley, New York"},{"key":"70_CR21","volume-title":"Location theory, a unified approach","author":"S Nickel","year":"2005","unstructured":"Nickel S, Puerto J (2005) Location theory, a unified approach. Springer, Berlin"},{"key":"70_CR22","first-page":"51","volume":"21","author":"X Yang","year":"2008","unstructured":"Yang X, Zhang J (2008) Inverse center location problem on a tree. J Syst Sci Complex 21: 51\u2013664","journal-title":"J Syst Sci Complex"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0070-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-009-0070-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0070-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:30:22Z","timestamp":1559140222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-009-0070-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,17]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["70"],"URL":"https:\/\/doi.org\/10.1007\/s00607-009-0070-7","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,17]]}}}