{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:06Z","timestamp":1725501066294},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_34","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T05:49:24Z","timestamp":1189748964000},"page":"375-383","source":"Crossref","is-referenced-by-count":4,"title":["Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance"],"prefix":"10.1007","author":[{"given":"Longcheng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Enyu","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","volume":"7","author":"P.M. Camerini","year":"1978","unstructured":"Camerini, P.M.: The min-max spanning tree problem and some extansions. Information Processing Letters\u00a07, 10\u201314 (1978)","journal-title":"Information Processing Letters"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10878-006-9016-6","volume":"13","author":"C. Yang","year":"2007","unstructured":"Yang, C., Zhang, J., Ma, Z.: Some inverse min-max network problems under weighted l\n                1 and l\n                \u2009\u221e\u2009 norms with bound constrints on changes. Journal of Combinatorial Optimization\u00a013, 123\u2013135 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C. Heuberger","year":"2004","unstructured":"Heuberger, C.: Inverse Optimization: A survey on problems, methods, and results. Journal of Combinatorial Optimization\u00a08, 329\u2013361 (2004)","journal-title":"Journal of Combinatorial Optimization"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10878-005-5486-1","volume":"9","author":"Y. He","year":"2005","unstructured":"He, Y., Zhang, B.W., Yao, E.Y.: Wighted inverse minimum spanning tree problems under Hamming distance. Journal of Combinatorial Optimization\u00a09, 91\u2013100 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"34_CR5","first-page":"47","volume":"34","author":"Y. He","year":"2006","unstructured":"He, Y., Zhang, B.W., Zhang, J.Z.: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance. Journal of Global Optimization\u00a034(3), 47\u2013474 (2006)","journal-title":"Journal of Global Optimization"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10878-005-6856-4","volume":"9","author":"B.W. Zhang","year":"2005","unstructured":"Zhang, B.W., Zhang, J.Z., He, Y.: The center location improvement problem under the Hamming distance. Journal of Combinatorial Optimization\u00a09, 187\u2013198 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1007\/11533719_99","volume-title":"Computing and Combinatorics","author":"X.G. Yang","year":"2005","unstructured":"Yang, X.G., Zhang, J.Z.: Sone new results on inverse sorting problems. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 985\u2013992. Springer, Heidelberg (2005)"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10878-006-9006-8","volume":"12","author":"L.C. Liu","year":"2006","unstructured":"Liu, L.C., Zhang, J.Z.: Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization\u00a012, 395\u2013408 (2006)","journal-title":"Journal of Combinatorial Optimization"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Liu, L.C., Yao, E.Y.: Weighted inverse minimum cut problem under the bottleneck type Hamming distance. Asia-Pacific Journal of Operational Research (to appear)","DOI":"10.1142\/S0217595907001474"},{"key":"34_CR10","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:13Z","timestamp":1619519293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}