{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:38:00Z","timestamp":1777520280359,"version":"3.51.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,3,21]],"date-time":"2008-03-21T00:00:00Z","timestamp":1206057600000},"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":[[2009,1]]},"DOI":"10.1007\/s10898-008-9294-x","type":"journal-article","created":{"date-parts":[[2008,3,20]],"date-time":"2008-03-20T14:43:38Z","timestamp":1206024218000},"page":"83-95","source":"Crossref","is-referenced-by-count":32,"title":["Constrained inverse min\u2013max spanning tree problems under the weighted Hamming distance"],"prefix":"10.1007","volume":"43","author":[{"given":"Longcheng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,21]]},"reference":[{"key":"9294_CR1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","volume":"7","author":"P.M. Camerini","year":"1978","unstructured":"Camerini P.M. (1978). The min\u2013max spanning tree problem and some extensions. Inform. Process. Lett. 7: 10\u201314","journal-title":"Inform. Process. Lett."},{"key":"9294_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10878-006-9016-6","volume":"13","author":"X.G. Yang","year":"2007","unstructured":"Yang X.G. and Zhang J.Z. (2007). 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","journal-title":"J. Comb. Optim."},{"key":"9294_CR3","doi-asserted-by":"crossref","unstructured":"Liu, L.C., Yao, E.Y.: Inverse min\u2013max spanning tree problem under the weighted sum-type Hamming distance. In: Theor Comput Sci (2007). doi: 10.1016\/j.tcs.2007.12.006","DOI":"10.1016\/j.tcs.2007.12.006"},{"key":"9294_CR4","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. Comb. Optim. 8: 329\u2013361","journal-title":"J. Comb. Optim."},{"key":"9294_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10878-005-5486-1","volume":"9","author":"Y. He","year":"2005","unstructured":"He Y., Zhang B. and Yao E. (2005). Wighted inverse minimum spanning tree problems under Hamming distance. J. Comb. Optim. 9: 91\u2013100","journal-title":"J. Comb. Optim."},{"issue":"3","key":"9294_CR6","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10898-005-6470-0","volume":"34","author":"Y. He","year":"2006","unstructured":"He Y., Zhang B. and Zhang J. (2006). Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance. J. Glob. Optim. 34(3): 467\u2013474","journal-title":"J. Glob. Optim."},{"key":"9294_CR7","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. and 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":"9294_CR8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10878-005-6856-4","volume":"9","author":"B. Zhang","year":"2005","unstructured":"Zhang B., Zhang J. and He Y. (2005). The center location improvement problem under the Hamming distance. J. Comb. Optim. 9: 187\u2013198","journal-title":"J. Comb. Optim."},{"key":"9294_CR9","doi-asserted-by":"crossref","unstructured":"Yang, X.G., Zhang, J.Z.: Some new results on inverse sorting problems. In: Lecture Notes in Computer Science, vol. 3595, pp. 985\u2013992 (2005)","DOI":"10.1007\/11533719_99"},{"key":"9294_CR10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10878-006-9006-8","volume":"12","author":"L.C. Liu","year":"2006","unstructured":"Liu L.C. and Zhang J.Z. (2006). Inverse maximum flow problems under the weighted Hamming distance. J. Comb. Optim. 12: 395\u2013408","journal-title":"J. Comb. Optim."},{"issue":"5","key":"9294_CR11","first-page":"1","volume":"24","author":"L.C. Liu","year":"2007","unstructured":"Liu L.C. and Yao E.Y. (2007). Weighted inverse minimum cut problem under the bottleneck-type Hamming distance. Asia-Pac. J. Oper. Res. 24(5): 1\u201312","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"9294_CR12","doi-asserted-by":"crossref","unstructured":"Guan, X., Zhang, J.: Inverse Bottleneck Optimization Problems under Weighted Hamming Distance. In: Lecture Notes in Computer Science, vol. 4041, pp. 220\u2013230 (2006)","DOI":"10.1007\/11775096_21"},{"key":"9294_CR13","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A. (2003). Combinatorial Optimization, Polyhedra and Efficiency. Springer-Verlag, Berlin"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-008-9294-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-008-9294-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-008-9294-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:12:11Z","timestamp":1559304731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-008-9294-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,21]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["9294"],"URL":"https:\/\/doi.org\/10.1007\/s10898-008-9294-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,21]]}}}