{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:02:23Z","timestamp":1759838543858},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/s10878-005-5486-1","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T22:08:53Z","timestamp":1108591733000},"page":"91-100","source":"Crossref","is-referenced-by-count":48,"title":["Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance"],"prefix":"10.1007","volume":"9","author":[{"given":"Yong","family":"He","sequence":"first","affiliation":[]},{"given":"Binwu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Enyu","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows: Theory, Algorithms, and Applications, Prentice Hall: Englewood Cliffs, NJ, 1993."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/jagm.1999.1052","volume":"34","author":"R.K. Ahuja","year":"2000","unstructured":"R.K. Ahuja and J.B. Orlin ?A faster algorithm for the inverse spanning tree problem,?Journal of Algorithms, vol. 34, pp. 177?193, 2000.","journal-title":"Journal of Algorithms"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C. Heuberger","year":"2004","unstructured":"C. Heuberger ?Inverse optimization: A survey on problems, methods, and results,?Journal of Combinatorial Optimization, vol. 8, pp. 329?361, 2004.","journal-title":"Journal of Combinatorial Optimization"},{"key":"CR4","unstructured":"E.L. Lawler Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, 1976."},{"key":"CR5","unstructured":"B.Y. Li ?New models for spanning tree problems in network optimization: Algorithms and complexity,?Ph.D. Thesis, Zhejiang University, Hangzhou, 2000."},{"key":"CR6","unstructured":"R. Motwani Approximation Algorithms, Lecture Notes, Stanford University, Stanford, 2000."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1287\/opre.47.2.291","volume":"47","author":"P.T. Sokkalingam","year":"1999","unstructured":"P.T. Sokkalingam, R.K. Ahuja, and J.B. Orlin ?Solving inverse spanning tree problems through network flow techniques,?Oper. Res., vol. 47, pp. 291?298, 1999.","journal-title":"Oper. Res."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1013807829021","volume":"6","author":"J. Zhang","year":"2002","unstructured":"J. Zhang and Z. Liu ?A generalized model of some inverse combinatorial optimization problems and its solution method under l? norm,?Journal of Combinatorial Optimization, vol. 6, pp. 207?227, 2002.","journal-title":"Journal of Combinatorial Optimization"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01194328","volume":"44","author":"J. Zhang","year":"1996","unstructured":"J. Zhang, Z. Liu, and Z. Ma ?On the inverse problem of minimum spanning tree with partition constraints,?Math. Methods Oper. Res., vol. 44, pp. 171?188, 1996.","journal-title":"Math. Methods Oper. Res."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1009829525096","volume":"3","author":"J. Zhang","year":"1999","unstructured":"J. Zhang and Z. Ma ?Solution structrue of some inverse combinatorial optimization problems,?Journal of Combinatorial Optimization, vol. 3, pp. 127?139, 1999.","journal-title":"Journal of Combinatorial Optimization"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"J. Zhang","year":"1997","unstructured":"J. Zhang, S. Xu, and Z. Ma ?An algorithm for inverse minimum spannimg tree problem,?Optimization Metheds & Software, vol. 8, pp. 69?84, 1997.","journal-title":"Optimization Metheds & Software"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5486-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-5486-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5486-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:09Z","timestamp":1559276289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-5486-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["5486"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-5486-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}