{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:24:25Z","timestamp":1774373065461,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,23]],"date-time":"2011-06-23T00:00:00Z","timestamp":1308787200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10898-011-9742-x","type":"journal-article","created":{"date-parts":[[2011,6,22]],"date-time":"2011-06-22T12:57:51Z","timestamp":1308747471000},"page":"75-82","source":"Crossref","is-referenced-by-count":49,"title":["Inverse 1-median problem on trees under weighted Hamming distance"],"prefix":"10.1007","volume":"54","author":[{"given":"Xiucui","family":"Guan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binwu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,23]]},"reference":[{"issue":"4","key":"9742_CR1","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 R.E., Pferschy U.: Inverse 1-center location problems with edge length augmentation on trees. Computing 86(4), 331\u2013343 (2009)","journal-title":"Computing"},{"key":"9742_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.: An algorithm for large zero-one knapsack problems. Oper. Res. 28, 1130\u20131154 (1980)","journal-title":"Oper. Res."},{"issue":"3","key":"9742_CR3","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10100-009-0114-2","volume":"18","author":"F.B. Bonab","year":"2010","unstructured":"Bonab F.B., Burkard R.E., Alizadeh B.: Inverse median location problems with variable coordinates. Cen. Eur. J. Oper. Res. 18(3), 365\u2013381 (2010)","journal-title":"Cen. Eur. J. Oper. Res."},{"issue":"1","key":"9742_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.ejor.2010.01.046","volume":"206","author":"R.E. Burkard","year":"2010","unstructured":"Burkard R.E., Galavii M., Gassner E.: The inverse Fermat-Weber problem. Eur. J. Oper. Res. 206(1), 11\u201317 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9742_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.disopt.2004.03.003","volume":"1","author":"R.E. Burkard","year":"2004","unstructured":"Burkard R.E., Pleschiutschnig C., Zhang J.: Inverse median problems. Discrete Optim. 1, 23\u201339 (2004)","journal-title":"Discrete Optim."},{"key":"9742_CR6","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.disopt.2006.11.008","volume":"5","author":"R.E. Burkard","year":"2008","unstructured":"Burkard R.E., Pleschiutschnig C., Zhang J.Z.: The inverse 1-median problem on a cycle. Discrete Optim. 5, 242\u2013253 (2008)","journal-title":"Discrete Optim."},{"key":"9742_CR7","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1008360312607","volume":"5","author":"M. Cai","year":"1999","unstructured":"Cai M., Yang X., Zhang J.: The complexity analysis of the inverse center location problem. J. Glob. Optim. 5, 213\u2013218 (1999)","journal-title":"J. Glob. Optim."},{"key":"9742_CR8","doi-asserted-by":"crossref","unstructured":"Cao, Y.B., Guan, X.C.: A class of constrained inverse bottleneck optimization problems under weighted Hamming distance. In: Proceedings of International Joint Conference on Computational Sciences and Optimization, IEEE Computer Society vol. 2, pp. 859\u2013863 (2009)","DOI":"10.1109\/CSO.2009.384"},{"key":"9742_CR9","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/j.ejor.2004.07.059","volume":"170","author":"C.W. Duin","year":"2006","unstructured":"Duin C.W., Volgenant A.: Some inverse optimization problems under the Hamming distance. Eur. J. Oper. Res. 170, 887\u2013899 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9742_CR10","unstructured":"Galavii, M.: Inverse 1-median problems. Ph.D. Thesis, Institute of Optimization and Discrete Mathematics, Graz University of Technology, Graz (2008)"},{"key":"9742_CR11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/s10878-007-9098-9","volume":"16","author":"E. Gassner","year":"2008","unstructured":"Gassner E.: The inverse 1-Maxian problem with edge length modiffication. J. Comb. Optim. 16, 50\u201367 (2008)","journal-title":"J. Comb. Optim."},{"key":"9742_CR12","first-page":"77","volume":"2","author":"A.J. Goldman","year":"1962","unstructured":"Goldman A.J.: Optimal center location in simple networks. Transp. Sci. 2, 77\u201391 (1962)","journal-title":"Transp. Sci."},{"key":"9742_CR13","doi-asserted-by":"crossref","unstructured":"Guan, X.C., Zhang, B.W.: Inverse 1-median problem on trees under weighted l \u221e norm. Lect. Notes Comput. Sci. 6124, 150\u2013160 (2010)","DOI":"10.1007\/978-3-642-14355-7_16"},{"key":"9742_CR14","doi-asserted-by":"crossref","first-page":"3243","DOI":"10.1016\/j.cor.2005.12.003","volume":"34","author":"X.C. Guan","year":"2007","unstructured":"Guan X.C., Zhang J.Z.: Inverse constrained bottleneck problems under weighted l \u221e norm. Comput. Oper. Res. 34, 3243\u20133254 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9742_CR15","doi-asserted-by":"crossref","unstructured":"Guan, X.C., Zhang, J.Z.: Inverse bottleneck optimization problems under weighted Hamming distance. Lect. Notes Comput. Sci. 4041, 220\u2013230 (2006)","DOI":"10.1007\/11775096_21"},{"key":"9742_CR16","unstructured":"Hua et\u00a0al.: Applications of mathematical models to wheat harvesting. Acta Mathematica Sinica 11, 63C75 (1961) (in Chinese) (English translation in Chinese Math. 2, 77C91 (1962))"},{"key":"9742_CR17","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 G.J.: Approximation schemes for a class of subset selection problems. Theor. Comput. Sci. 382, 151\u2013156 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9742_CR18","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"M. Silvano","year":"1990","unstructured":"Silvano M., Toth P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York, NY, USA (1990)"},{"key":"9742_CR19","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10878-006-9016-6","volume":"13","author":"X. Yang","year":"2007","unstructured":"Yang X., Zhang J.: Some inverse min\u2013max network problems under weighted l 1 and l \u221e norms with bound constraints on changes. J. Comb. Optim. 13, 123\u2013135 (2007)","journal-title":"J. Comb. Optim."},{"key":"9742_CR20","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.: Inverse center location problem on a tree. J. Syst. Sci. Complex. 21, 651\u2013664 (2008)","journal-title":"J. Syst. Sci. Complex."},{"key":"9742_CR21","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10898-005-6470-0","volume":"34","author":"B. Zhang","year":"2006","unstructured":"Zhang B., Zhang J., He Y.: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance. J. Glob. Optim. 34, 467\u2013474 (2006)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9742-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9742-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9742-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T04:04:30Z","timestamp":1560312270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9742-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,23]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9742"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9742-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,23]]}}}