{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:05:42Z","timestamp":1782997542157,"version":"3.54.5"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,10,3]],"date-time":"2009-10-03T00:00:00Z","timestamp":1254528000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10100-009-0114-2","type":"journal-article","created":{"date-parts":[[2009,10,2]],"date-time":"2009-10-02T01:52:10Z","timestamp":1254448330000},"page":"365-381","source":"Crossref","is-referenced-by-count":26,"title":["Inverse median location problems with variable coordinates"],"prefix":"10.1007","volume":"18","author":[{"given":"Fahimeh","family":"Baroughi Bonab","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rainer E.","family":"Burkard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Behrooz","family":"Alizadeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,10,3]]},"reference":[{"key":"114_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-09, Graz University of Technology","DOI":"10.1002\/net.20427"},{"key":"114_CR2","doi-asserted-by":"crossref","unstructured":"Alizadeh B, Burkard RE, Pferschy U (2009) Inverse 1-center location problems with edge length augmentation on trees. To appear in Computing","DOI":"10.1007\/s00607-009-0070-7"},{"key":"114_CR3","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 problem. Oper Res 28: 1130\u20131154","journal-title":"Oper Res"},{"key":"114_CR4","unstructured":"Baroughi Bonab F, Burkard RE, Gassner E (2009) Inverse p-median problems with variable edge lengths. Technical Report 2009-13, Graz University of Technology"},{"key":"114_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":"114_CR6","unstructured":"Burkard RE, Galavii M, Gassner E (2008a) The inverse Fermat\u2013Weber problem. Technical Report 2008-14, Graz University of Technology"},{"key":"114_CR7","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 JZ (2008b) The inverse 1- median problem on a cycle. Discret Optim 5: 242\u2013253","journal-title":"Discret Optim"},{"key":"114_CR8","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":"114_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/s10878-007-9098-9","volume":"16","author":"E Gassner","year":"2008","unstructured":"Gassner E (2008) The inverse 1-maxian problem with edge length modification. J Comb Optim 16: 50\u201367","journal-title":"J Comb Optim"},{"key":"114_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-01968-8","volume-title":"Mathematische L\u00f6sungsverfahren f\u00fcr planare Standortprobleme","author":"HW Hamacher","year":"1995","unstructured":"Hamacher HW (1995) Mathematische L\u00f6sungsverfahren f\u00fcr planare Standortprobleme. Vieweg, Braunschweig"},{"key":"114_CR11","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":"114_CR12","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester"},{"key":"114_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.tcs.2007.03.006","volume":"382","author":"K Pruhs","year":"2007","unstructured":"Pruhs K, Woeginger GJ (2007) Approximation schemes for a class of subset selection problems. Theor Comput Sci 382: 151\u2013156","journal-title":"Theor Comput Sci"},{"key":"114_CR14","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/s11424-008-9142-6","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: 651\u2013664","journal-title":"J Syst Sci Complex"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-009-0114-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-009-0114-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-009-0114-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:26Z","timestamp":1559108966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-009-0114-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["114"],"URL":"https:\/\/doi.org\/10.1007\/s10100-009-0114-2","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,3]]}}}