{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:12:33Z","timestamp":1758273153391,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T00:00:00Z","timestamp":1502841600000},"content-version":"unspecified","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":["11571155"],"award-info":[{"award-number":["11571155"]}],"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":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531011","61222201"],"award-info":[{"award-number":["11531011","61222201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10898-017-0554-5","type":"journal-article","created":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T08:42:41Z","timestamp":1502872961000},"page":"677-685","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$ l p -norm"],"prefix":"10.1007","volume":"70","author":[{"given":"Xianyue","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"issue":"5","key":"554_CR1","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 optimiztion. Oper. Res. 49(5), 771\u2013783 (2001)","journal-title":"Oper. Res."},{"key":"554_CR2","doi-asserted-by":"crossref","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":"554_CR3","doi-asserted-by":"crossref","unstructured":"Burton, D., Toint, Ph.L.: On an instance of the inverse shortest paths problem. Math. Progr. 53(1), 45\u201361 (1992)","DOI":"10.1007\/BF01585693"},{"key":"554_CR4","doi-asserted-by":"crossref","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 increase is forbidden. Eur. J. Oper. Res. 188, 348\u2013353 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"554_CR5","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1137\/S0097539791278376","volume":"25","author":"J Cheriyan","year":"1996","unstructured":"Cheriyan, J., Hagerup, T., Mehlhorn, K.: An $$O(n^3)$$ O ( n 3 ) -time maximum-flow algorithm. SIAM J. Comput. 25(6), 1144\u20131170 (1996)","journal-title":"SIAM J. Comput."},{"key":"554_CR6","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23, 864\u2013894 (1994)","journal-title":"SIAM J. Comput."},{"key":"554_CR7","doi-asserted-by":"crossref","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":"554_CR8","volume-title":"Paradigms of Combinatorial Optimization","author":"M Demange","year":"2014","unstructured":"Demange, M., Monnot, J.: An introductuion to inverse combinatorial problems. In: Paschos, V.Th (ed.) Paradigms of Combinatorial Optimization, 2nd edn. Wliey, Hoboken (2014)","edition":"2"},{"key":"554_CR9","doi-asserted-by":"crossref","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$$ L 1 -norm is strongly NP-hard. RAIRO Oper. Res. 44, 241\u2013249 (2010)","journal-title":"RAIRO Oper. Res."},{"issue":"1","key":"554_CR10","doi-asserted-by":"crossref","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+Sum spanning tree problem by modifying the sum-cost vector under weighted $$l_{\\infty }$$ l \u221e Norm. J. Glob. Optim. 61(1), 165\u2013182 (2015)","journal-title":"J. Glob. Optim."},{"key":"554_CR11","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 combinatorial optimization: a survey on problems, methods, and results. J. Comb. Optim. 8, 329\u2013361 (2004)","journal-title":"J. Comb. Optim."},{"key":"554_CR12","unstructured":"Lai, T., Orlin, J.: The complexity of preprocessing. Research Report of Sloan School of Management, MIT (2003)"},{"key":"554_CR13","doi-asserted-by":"crossref","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.: Algorithm for constraint partial inverse matroid problem with weight increase forbidden. Theor. Comput. Sci. 640, 119\u2013124 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"554_CR14","doi-asserted-by":"crossref","unstructured":"Orlin, J. B.: Max flows in $$O(nm)$$ O ( n m ) time, or better. In: Proceedings of the forty-fifth annual ACM Symposium on Theory of Computing (STOC 2013), 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"554_CR15","doi-asserted-by":"crossref","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":"554_CR16","doi-asserted-by":"crossref","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$$ l 1 norm. Oper. Res. Lett. 35, 23\u201328 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"554_CR17","doi-asserted-by":"crossref","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 problems. Comput. Optim. Appl. 36(1), 55\u201366 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"554_CR18","doi-asserted-by":"crossref","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., D, 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\/article\/10.1007\/s10898-017-0554-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0554-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0554-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T23:00:10Z","timestamp":1750806010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0554-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,16]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["554"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0554-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,8,16]]}}}