{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T11:55:24Z","timestamp":1780574124133,"version":"3.54.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:00:00Z","timestamp":1582588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:00:00Z","timestamp":1582588800000},"content-version":"vor","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":"crossref","award":["11471073"],"award-info":[{"award-number":["11471073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005236","name":"Chinese Universities Scientific Fund","doi-asserted-by":"crossref","award":["2018B44014"],"award-info":[{"award-number":["2018B44014"]}],"id":[{"id":"10.13039\/501100005236","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11590-020-01553-8","type":"journal-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T15:02:41Z","timestamp":1582642961000},"page":"2301-2322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Inverse optimal value problem on minimum spanning tree under unit $$l_{\\infty }$$ norm"],"prefix":"10.1007","volume":"14","author":[{"given":"Binwu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-1868","authenticated-orcid":false,"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,2,25]]},"reference":[{"issue":"1","key":"1553_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0515-x","volume":"102","author":"S Ahmed","year":"2005","unstructured":"Ahmed, S., Guan, Y.P.: The inverse optimal value problem. Math. Program. 102(1), 91\u2013110 (2005)","journal-title":"Math. Program."},{"key":"1553_CR2","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. Prentice Hall, Englewood Cliffs (1993)"},{"key":"1553_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/jagm.1999.1052","volume":"34","author":"RK Ahuja","year":"2000","unstructured":"Ahuja, R.K., Orlin, J.B.: A faster algorithm for the inverse spanning tree problem. J. Algorithms 34, 177\u2013193 (2000)","journal-title":"J. Algorithms"},{"key":"1553_CR4","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.ejor.2007.04.031","volume":"188","author":"MC Cai","year":"2008","unstructured":"Cai, M.C., Duin, C.W., Yang, X., Zhang, J.: The partial inverse minimum spanning tree problem when weight increase is forbidden. Eur. J. Oper. Res. 188, 348\u2013353 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1553_CR5","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10898-017-0546-5","volume":"69","author":"XC Guan","year":"2017","unstructured":"Guan, X.C., He, X.Y., Pardalos, P.M., Zhang, B.W.: Inverse max+sum spanning tree problem under hamming distance by modifying the sum-cost vector. J. Glob. Optim. 69(4), 911\u2013925 (2017)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"1553_CR6","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s11590-017-1165-2","volume":"12","author":"XC Guan","year":"2018","unstructured":"Guan, X.C., Pardalos, P.M., Zhang, B.W.: Inverse max+sum spanning tree problem under weighted $$l_1$$ norm by modifying the sum-cost vector. Optim. Lett. 12(5), 1065\u20131077 (2018)","journal-title":"Optim. Lett."},{"issue":"1","key":"1553_CR7","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.: Weighted inverse minimum spanning tree problems under Hamming distance. J. Comb. Optim. 9(1), 91\u2013100 (2005)","journal-title":"J. Comb. Optim."},{"key":"1553_CR8","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1287\/opre.51.5.785.16756","volume":"51","author":"DS Hochbaum","year":"2003","unstructured":"Hochbaum, D.S.: Efficient algorithms for the inverse spanning-tree problem. Oper. Res. 51, 785\u2013797 (2003)","journal-title":"Oper. Res."},{"key":"1553_CR9","unstructured":"Lai, T., Orlin, J.: The complexity of preprocessing. Research Report of Sloan School of Management, MIT (2003)"},{"key":"1553_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tcs.2016.06.002","volume":"640","author":"S Li","year":"2016","unstructured":"Li, S., Zhang, Z., Lai, H.J.: Algorithms for constraint partial inverse matroid problem with weight increase forbidden. Theor. Comput. Sci. 640, 119\u2013124 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"1553_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.cam.2007.08.005","volume":"220","author":"YB Lv","year":"2008","unstructured":"Lv, Y.B., Hua, T.S., Wan, Z.P.: A penalty function method for solving inverse optimal value problem. J. Comput. Appl. Math. 220(1\u20132), 175\u2013180 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"1553_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2007.12.006","volume":"396","author":"LC Liu","year":"2008","unstructured":"Liu, L.C., Yao, E.Y.: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance. Theor. Comput. Sci. 396, 28\u201334 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"1553_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1287\/opre.47.2.291","volume":"47","author":"PT Sokkalingam","year":"1999","unstructured":"Sokkalingam, P.T., Ahuja, R.K., Orlin, J.B.: Solving inverse spanning tree problems through network flow techniques. Oper. Res. 47, 291\u2013298 (1999)","journal-title":"Oper. Res."},{"issue":"2","key":"1553_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10878-006-9016-6","volume":"13","author":"XG Yang","year":"2007","unstructured":"Yang, X.G., Zhang, J.Z.: Some inverse min-max network problems under weighted $$l_1$$ and $$l_{\\infty }$$ norms with bound constraints on changes. J. Comb. Optim. 13(2), 123\u2013135 (2007)","journal-title":"J. Comb. Optim."},{"key":"1553_CR15","doi-asserted-by":"publisher","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 bottleneck-type Hamming distance. J. Glob. Optim. 34, 467\u2013474 (2006)","journal-title":"J. Glob. Optim."},{"key":"1553_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01194328","volume":"44","author":"JZ Zhang","year":"1996","unstructured":"Zhang, J.Z., Liu, Z.H., Ma, Z.F.: On the inverse problem of minimum spanning tree with partition constraints. Math. Methods Oper. Res. 44, 171\u2013188 (1996)","journal-title":"Math. Methods Oper. Res."},{"key":"1553_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1080\/02331939608844197","volume":"37","author":"JZ Zhang","year":"1996","unstructured":"Zhang, J.Z., Ma, Z.F.: A network flow method for solving some inverse combinatorial optimization problems. Optimization 37, 59\u201372 (1996)","journal-title":"Optimization"},{"key":"1553_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"JZ Zhang","year":"1997","unstructured":"Zhang, J.Z., Xu, S.J., Ma, Z.F.: An algorithm for inverse minimum spanning tree problem. Optim. Methods Softw. 8, 69\u201384 (1997)","journal-title":"Optim. Methods Softw."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01553-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01553-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01553-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T00:30:47Z","timestamp":1614126647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01553-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,25]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1553"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01553-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,25]]},"assertion":[{"value":"21 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}