{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:29Z","timestamp":1759063769010,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T00:00:00Z","timestamp":1436227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["ID0EWKAE15"],"award-info":[{"award-number":["ID0EWKAE15"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fujian Provincial Natural Science Foundation of China","award":["ID0EAPAE16"],"award-info":[{"award-number":["ID0EAPAE16"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["ID0EITAE17"],"award-info":[{"award-number":["ID0EITAE17"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-015-0919-y","type":"journal-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T12:28:34Z","timestamp":1436185714000},"page":"1257-1268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Capacity inverse minimum cost flow problems under the weighted Hamming distance"],"prefix":"10.1007","volume":"10","author":[{"given":"Longcheng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Enyu","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,7]]},"reference":[{"key":"919_CR1","volume-title":"Network flows: Theory, Algorithms and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, Algorithms and Applications. Pretice Hall, New York (1993)"},{"key":"919_CR2","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"RK Ahuja","year":"2001","unstructured":"Ahuja, R.K., Orlin, J.B.: Inverse optimization. Oper. Res. 49, 771\u2013783 (2001)","journal-title":"Oper. Res."},{"key":"919_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton, D., Toint, P.L.: On an instance of the inverse shortest paths problem. Math. Program. 53, 45\u201361 (1992)","journal-title":"Math. Program."},{"key":"919_CR4","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/j.ejor.2004.07.059","volume":"170","author":"CW 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":"919_CR5","doi-asserted-by":"crossref","unstructured":"G $$\\ddot{u}$$ u \u00a8 ler, C., Hamacher, H.W.: Capacity inverse minimum cost flow problem. J. Comb. Optim. 19, 43\u201359 (2010)","DOI":"10.1007\/s10878-008-9159-8"},{"key":"919_CR6","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":"919_CR7","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":"919_CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.ejor.2010.03.029","volume":"207","author":"YW Jiang","year":"2010","unstructured":"Jiang, Y.W., Liu, L.C., Wu, B., Yao, E.Y.: Inverse minimum cost flow problems under the weighted Hamming distance. Eur. J. Oper. Res. 207, 50\u201354 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"919_CR9","unstructured":"Kann, V.:On the approximability of NP-complete optimization problems. Ph.D thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Sweden (1992)"},{"key":"919_CR10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10878-006-9006-8","volume":"12","author":"LC 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":"919_CR11","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.ejor.2013.11.014","volume":"234","author":"J Tayyebi","year":"2014","unstructured":"Tayyebi, J., Aman, M.: Note on \u201cInverse minimum cost flow problems under the weighted Hamming distance\u201d. Eur. J. Oper. Res. 234, 916\u2013920 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"919_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10589-006-0394-6","volume":"36","author":"XG 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. Comput. Optim. Appl. 36, 55\u201366 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"919_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10878-005-6856-4","volume":"9","author":"BW Zhang","year":"2005","unstructured":"Zhang, B.W., Zhang, J.Z., He, Y.: The center location improvement problem under the Hamming distance. J. Comput. Optim. 9, 187\u2013198 (2005)","journal-title":"J. Comput. Optim."},{"key":"919_CR14","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10898-005-6470-0","volume":"34","author":"BW 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. Global Optim. 34, 467\u2013474 (2006)","journal-title":"J. Global Optim."},{"key":"919_CR15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","volume":"72","author":"JZ Zhang","year":"1996","unstructured":"Zhang, J.Z., Liu, Z.: Calculating some inverse linear programming problems. J. Comput. Appl. Math. 72, 261\u2013273 (1996)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0919-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0919-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0919-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T12:31:30Z","timestamp":1589545890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0919-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,7]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["919"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0919-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2015,7,7]]}}}