{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T12:00:15Z","timestamp":1775908815040,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,2,13]],"date-time":"2011-02-13T00:00:00Z","timestamp":1297555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00186-011-0346-5","type":"journal-article","created":{"date-parts":[[2011,2,11]],"date-time":"2011-02-11T22:11:09Z","timestamp":1297462269000},"page":"263-280","source":"Crossref","is-referenced-by-count":52,"title":["Inverse p-median problems with variable edge lengths"],"prefix":"10.1007","volume":"73","author":[{"given":"Fahimeh","family":"Baroughi Bonab","sequence":"first","affiliation":[]},{"given":"Rainer E.","family":"Burkard","sequence":"additional","affiliation":[]},{"given":"Elisabeth","family":"Gassner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,13]]},"reference":[{"key":"346_CR1","doi-asserted-by":"crossref","unstructured":"Alizadeh B, Burkard RE Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks. published online 2010 in Wiley Online Library. doi: 10.1002\/net.20427","DOI":"10.1002\/net.20427"},{"key":"346_CR2","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":"346_CR3","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10100-009-0114-2","volume":"18","author":"F Baroughi Bonab","year":"2010","unstructured":"Baroughi Bonab F, Burkard RE, Alizadeh B (2010) Inverse median location problems with variable coordinates. Central Euro J Oper Res 18: 365\u2013381","journal-title":"Central Euro J Oper Res"},{"key":"346_CR4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/11561071_26","volume":"3669","author":"R Benkoczi","year":"2005","unstructured":"Benkoczi R, Bhattacharya B (2005) A new template for solving p-median problems for trees in sub-quadratic time (extended abstract). Lecture Notes Comput Sci 3669: 271\u2013282","journal-title":"Lecture Notes Comput Sci"},{"key":"346_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.ejor.2010.01.046","volume":"206","author":"RE Burkard","year":"2010","unstructured":"Burkard RE, Galavii M, Gassner E (2010) The inverse Fermat-Weber problem. Euro J Oper Res 206: 11\u201317","journal-title":"Euro J Oper Res"},{"key":"346_CR6","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. Dis Opt 1: 23\u201339","journal-title":"Dis Opt"},{"key":"346_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 (2008) The inverse 1-median problem on a cycle. Dis Opt 5: 242\u2013253","journal-title":"Dis Opt"},{"key":"346_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton D, Toint PhL (1992) On an instance of the inverse shortest path problem. Math Program 53: 45\u201361","journal-title":"Math Program"},{"key":"346_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 Global Opt 15: 213\u2013218","journal-title":"J Global Opt"},{"key":"346_CR10","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 Combinat Opt 16: 50\u201367","journal-title":"J Combinat Opt"},{"key":"346_CR11","doi-asserted-by":"crossref","unstructured":"Gassner E (2010) An inverse approach to convex ordered median problems in trees. J Combinat Opt published online 2010 doi: 10.1007\/s10878-010-9353-3","DOI":"10.1007\/s10878-010-9353-3"},{"key":"346_CR12","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, New York"},{"key":"346_CR13","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"AJ Goldman","year":"1971","unstructured":"Goldman AJ (1971) Optimal center location in simple networks. Transp Sci 5: 212\u2013221","journal-title":"Transp Sci"},{"key":"346_CR14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230260413","volume":"26","author":"B Gavish","year":"1995","unstructured":"Gavish B, Sridhar S (1995) Computing the 2-median on tree networks in O(n log n) time. Networks 26: 305\u2013317","journal-title":"Networks"},{"key":"346_CR15","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi SL (1964) Optimum location of switching centers and the absolute centers and medians of a graph. Operat Res 12: 450\u2013459","journal-title":"Operat Res"},{"key":"346_CR16","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 optimization: a survey on problems, methods, and results. J Combinat Opt 8: 329\u2013361","journal-title":"J Combinat Opt"},{"key":"346_CR17","first-page":"77","volume":"2","author":"LK Hua","year":"1962","unstructured":"Hua LK et\u00a0al (1962) Applications of mathematical models to wheat harvesting. Chin Math 2: 77\u201391","journal-title":"Chin Math"},{"key":"346_CR18","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi L (1979) An algorithmic approach to network location problems part 2: The p-medians. SIAM J Appl Math 37: 539\u2013560","journal-title":"SIAM J Appl Math"},{"key":"346_CR19","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N Megiddo","year":"1984","unstructured":"Megiddo N (1984) Linear programming in linear time when the dimension is fixed. J ACM 31: 114\u2013127","journal-title":"J ACM"},{"key":"346_CR20","volume-title":"Discrete location theory","author":"PB Mirchandani","year":"1990","unstructured":"Mirchandani PB, Francis RL (1990) Discrete location theory. Wiley, New York"},{"key":"346_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A Tamir","year":"1996","unstructured":"Tamir A (1996) An O(pn 2) algorithm for the p-median and related problems on tree graphs. Operat Res Lett 19: 59\u201364","journal-title":"Operat Res Lett"},{"key":"346_CR22","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 Complexity 21: 651\u2013664","journal-title":"J Syst Sci Complexity"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-011-0346-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-011-0346-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-011-0346-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T10:22:38Z","timestamp":1559989358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-011-0346-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,13]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["346"],"URL":"https:\/\/doi.org\/10.1007\/s00186-011-0346-5","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,13]]}}}