{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T09:53:29Z","timestamp":1781776409688,"version":"3.54.5"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T00:00:00Z","timestamp":1572825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T00:00:00Z","timestamp":1572825600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100018618","name":"National Numerical Wind tunnel Project","doi-asserted-by":"crossref","award":["NNW2019ZT5-B16"],"award-info":[{"award-number":["NNW2019ZT5-B16"]}],"id":[{"id":"10.13039\/501100018618","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11571155"],"award-info":[{"award-number":["11571155"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871256"],"award-info":[{"award-number":["11871256"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771013"],"award-info":[{"award-number":["11771013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531011"],"award-info":[{"award-number":["11531011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61751303"],"award-info":[{"award-number":["61751303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["lzujbky-2017-163"],"award-info":[{"award-number":["lzujbky-2017-163"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LD19A010001"],"award-info":[{"award-number":["LD19A010001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10898-019-00852-4","type":"journal-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:03:24Z","timestamp":1572876204000},"page":"319-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Approximation algorithms for capacitated partial inverse maximum spanning tree problem"],"prefix":"10.1007","volume":"77","author":[{"given":"Xianyue","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruowang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,11,4]]},"reference":[{"key":"852_CR1","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"},{"issue":"3","key":"852_CR2","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/opre.38.3.556","volume":"38","author":"O Ben-Ayed","year":"1990","unstructured":"Ben-Ayed, O., Blair, C.E.: Computational difficulties of bilevel linear programming. Oper. Res. 38(3), 556\u2013560 (1990)","journal-title":"Oper. Res."},{"key":"852_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"852_CR4","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.ejor.2007.04.031","volume":"188","author":"M-C Cai","year":"2008","unstructured":"Cai, M.-C., Duin, C.W., Yang, X., Zhang, J.: The partial inverse minimum spanning tree problem when weight increasing is forbidden. Eur. J. Oper. Res. 188, 348\u2013353 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"852_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0166-218X(02)00498-5","volume":"128","author":"M Dell\u2019Amico","year":"2003","unstructured":"Dell\u2019Amico, M., Maffioli, F., Malucelli, F.: The base-matroid and inverse combinatorial optimization problems. Discrete Appl. Math. 128, 337\u2013353 (2003)","journal-title":"Discrete Appl. Math."},{"key":"852_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1051\/ro\/2010017","volume":"44","author":"E Gassner","year":"2010","unstructured":"Gassner, E.: The partial inverse minimum cut problem with $$L_1$$-norm is strongly NP-hard. RAIRO Oper. Res. 44, 241\u2013249 (2010)","journal-title":"RAIRO Oper. Res."},{"issue":"4","key":"852_CR7","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10898-017-0546-5","volume":"69","author":"X Guan","year":"2017","unstructured":"Guan, X., He, X., Pardalos, P.M., Zhang, B.: Inverse max\u00a0+\u00a0sum 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":"852_CR8","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s11590-017-1165-2","volume":"12","author":"X Guan","year":"2018","unstructured":"Guan, X., Pardalos, P.M., Zhang, B.: Inverse max\u00a0+\u00a0sum 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":"852_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10898-014-0140-z","volume":"61","author":"X Guan","year":"2015","unstructured":"Guan, X., Pardalos, P.M., Zuo, X.: Inverse Max\u00a0+\u00a0Sum spanning tree problem by modifying the sum-cost vector under weighted $$l_\\infty $$ norm. J. Glob. Optim. 61(1), 165\u2013182 (2015)","journal-title":"J. Glob. Optim."},{"key":"852_CR10","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, B., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13, 1194\u20131217 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"852_CR11","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., Yao, E.: Weighted inverse minimum spanning tree problems under hamming distance. J. Comb. Optim. 9, 91\u2013100 (2005)","journal-title":"J. Comb. Optim."},{"issue":"5","key":"852_CR12","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(5), 785\u2013797 (2003)","journal-title":"Oper. Res."},{"issue":"2","key":"852_CR13","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1137\/S0895480100369584","volume":"16","author":"DS Hochbaum","year":"2003","unstructured":"Hochbaum, D.S., Queyranne, M.: Minimizing a convex cost closure set. SIAM J. Discrete Math. 16(2), 192\u2013207 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"852_CR14","unstructured":"Lai, T., Orlin, J.: The Complexity of Preprocessing, Research Report of Sloan School of Management, MIT (2003)"},{"key":"852_CR15","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":"4","key":"852_CR16","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/s10878-019-00433-x","volume":"38","author":"X Li","year":"2019","unstructured":"Li, X., Shu, X., Huang, H., Bai, J.: Capacitated partial inverse maximum spanning tree under the weighted Hamming distance. J. Comb. Optim. 38(4), 1005\u20131018 (2019)","journal-title":"J. Comb. Optim."},{"key":"852_CR17","unstructured":"Li, X., Yang, R., Zhang, Z., Zhang, H.: Capacitated partial inverse maximum spanning tree under the weighted $$l_\\infty $$-norm, Submitted"},{"key":"852_CR18","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s10898-017-0554-5","volume":"30","author":"X Li","year":"2018","unstructured":"Li, X., Zhang, Z., Du, D.-Z.: Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$-norm. J. Glob. Optim. 30, 677\u2013685 (2018)","journal-title":"J. Glob. Optim."},{"key":"852_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10898-008-9294-x","volume":"43","author":"L Liu","year":"2009","unstructured":"Liu, L., Wang, Q.: Constrained inverse min-max spanning tree problems under the weighted Hamming distance. J. Glob. Optim. 43, 83\u201395 (2009)","journal-title":"J. Glob. Optim."},{"key":"852_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2007.12.006","volume":"196","author":"L Liu","year":"2008","unstructured":"Liu, L., Yao, E.: Inverse min\u2013max spanning tree problem under the weighted sum-type Hamming distance. Theor. Comput. Sci. 196, 28\u201334 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"852_CR21","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."},{"key":"852_CR22","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1051\/ro:2001106","volume":"35","author":"X Yang","year":"2001","unstructured":"Yang, X.: Complexity of partial inverse assignment problem and partial inverse cut problem. RAIRO Oper. Res. 35, 117\u2013126 (2001)","journal-title":"RAIRO Oper. Res."},{"key":"852_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.orl.2005.12.003","volume":"35","author":"X Yang","year":"2007","unstructured":"Yang, X., Zhang, J.: Partial inverse assignment problem under $$l_1$$ norm. Oper. Res. Lett. 35, 23\u201328 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"852_CR24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10589-006-0394-6","volume":"36","author":"X Yang","year":"2007","unstructured":"Yang, X., Zhang, J.: Inverse sorting problem by minimizing the total weighted number of changers and partial inverse sorting problem. Comput. Optim. Appl. 36(1), 55\u201366 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"852_CR25","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10898-005-6470-0","volume":"34","author":"B Zhang","year":"2006","unstructured":"Zhang, B., Zhang, J., 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."},{"issue":"1","key":"852_CR26","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"J Zhang","year":"1997","unstructured":"Zhang, J., Xu, S., Ma, Z.: An algorithm for inverse minimum spanning tree problem. Optim. Methods Softw. 8(1), 69\u201384 (1997)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"852_CR27","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10898-016-0412-x","volume":"65","author":"Z Zhang","year":"2016","unstructured":"Zhang, Z., Li, S., Lai, H.-J., Du, D.-Z.: Algorithms for the partial inverse matroid problem in which weights can only be increased. J. Glob. Optim. 65(4), 801\u2013811 (2016)","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-019-00852-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00852-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00852-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T00:13:40Z","timestamp":1604362420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00852-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,4]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["852"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00852-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,4]]},"assertion":[{"value":"24 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}