{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T12:58:47Z","timestamp":1762865927569},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,4,4]],"date-time":"2012-04-04T00:00:00Z","timestamp":1333497600000},"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":[[2013,3]]},"DOI":"10.1007\/s10898-012-9901-8","type":"journal-article","created":{"date-parts":[[2012,4,3]],"date-time":"2012-04-03T12:34:29Z","timestamp":1333456469000},"page":"549-557","source":"Crossref","is-referenced-by-count":11,"title":["Weighted inverse maximum perfect matching problems under the Hamming distance"],"prefix":"10.1007","volume":"55","author":[{"given":"Longcheng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Enyu","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,4]]},"reference":[{"key":"9901_CR1","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge C.: Two theorems in graph theory. Proc. Natl. Acad. Sci. USA 43, 842\u2013844 (1957)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9901_CR2","doi-asserted-by":"crossref","unstructured":"Demange, M., Monnot, J.: An introduction to inverse combinatorial problems. In: Paradigms of Combinatorial Optimization (Problems and New approaches), pp. 547\u2013586. Wiley, London-Hoboken (UK-USA), Vangelis Th. Paschos (2010)","DOI":"10.1002\/9781119005353.ch17"},{"key":"9901_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J.: Maximum matching and a polyhedron with 0-1 vertices. J. Res. Natl. Bureau Stand. 69, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bureau Stand."},{"key":"9901_CR4","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.W., Yao E.Y.: Weighted inverse minimum spanning tree problems under Hamming distance. J. Comb. Optim. 9, 91\u2013100 (2005)","journal-title":"J. Comb. Optim."},{"key":"9901_CR5","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.: Inverse optimization: a survey on problems, methods, and results. J. Comb. Optim. 8, 329\u2013361 (2004)","journal-title":"J. Comb. Optim."},{"key":"9901_CR6","volume-title":"Combinatorial Optimization: Networks and Matroids Holt","author":"E.L. Lawler","year":"1976","unstructured":"Lawler E.L.: Combinatorial Optimization: Networks and Matroids Holt. Rinehart and Winston, New York (1976)"},{"issue":"6","key":"9901_CR7","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1080\/10020070612330048","volume":"16","author":"L.C. Liu","year":"2006","unstructured":"Liu L.C., He Y.: Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values. Prog. Nat. Sci. 16(6), 649\u2013655 (2006)","journal-title":"Prog. Nat. Sci."},{"key":"9901_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10898-008-9294-x","volume":"43","author":"L.C. Liu","year":"2009","unstructured":"Liu L.C., Wang Q.: Constrained inverse min\u2013max spanning tree problems under the weighted Hamming distance. J. Glob. Optim. 43, 83\u201395 (2009)","journal-title":"J. Glob. Optim."},{"key":"9901_CR9","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1142\/S0217595907001474","volume":"24","author":"L.C. Liu","year":"2007","unstructured":"Liu L.C., Yao E.Y.: A weighted inverse minimum cut problem under the bottleneck type Hamming distance. Asia-Pac. J. Oper. Res. 24, 725\u2013736 (2007)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"9901_CR10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2007.12.006","volume":"396","author":"L.C. Liu","year":"2008","unstructured":"Liu L.C., Yao E.Y.: Inverse min\u2013max spanning tree problem under the weighted sum-type Hamming distance. Theor. Comp. Sci. 396, 28\u201334 (2008)","journal-title":"Theor. Comp. Sci."},{"key":"9901_CR11","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., Zhang J.Z.: Inverse maximum flow problems under the weighted Hamming distance. J. Comb. Optim. 12, 395\u2013408 (2006)","journal-title":"J. Comb. Optim."},{"key":"9901_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1027305419461","volume":"7","author":"Z.H. Liu","year":"2003","unstructured":"Liu Z.H., Zhang J.Z.: On inverse problems of optimum perfect matching. J. Comb. Optim. 7, 215\u2013228 (2003)","journal-title":"J. Comb. Optim."},{"key":"9901_CR13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10589-006-0394-6","volume":"36","author":"X.G. Yang","year":"2007","unstructured":"Yang X.G., Zhang J.Z.: Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems. Comp. Optim. Appl. 36, 55\u201366 (2007)","journal-title":"Comp. Optim. Appl."},{"key":"9901_CR14","doi-asserted-by":"crossref","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. J. Comb. Optim. 9, 187\u2013198 (2005)","journal-title":"J. Comb. Optim."},{"key":"9901_CR15","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10898-005-6470-0","volume":"34","author":"B.W. Zhang","year":"2006","unstructured":"Zhang B.W., Zhang J.Z., 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-012-9901-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9901-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9901-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T16:58:44Z","timestamp":1561568324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9901-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,4]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9901"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9901-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,4]]}}}