{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T11:01:07Z","timestamp":1753441267684,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471073"],"award-info":[{"award-number":["11471073"]}],"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":[[2022,11]]},"DOI":"10.1007\/s10898-022-01170-y","type":"journal-article","created":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T03:24:11Z","timestamp":1652671451000},"page":"715-738","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Inverse max+sum spanning tree problem under weighted $$l_{\\infty }$$ norm by modifying max-weight vector"],"prefix":"10.1007","volume":"84","author":[{"given":"Junhua","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-1868","authenticated-orcid":false,"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinqiang","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,16]]},"reference":[{"key":"1170_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. Algorithm 34, 177\u2013193 (2000)","journal-title":"J. Algorithm"},{"key":"1170_CR2","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":"1170_CR3","doi-asserted-by":"publisher","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":"1170_CR4","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, 911\u2013925 (2017)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1170_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10898-014-0140-z","volume":"61","author":"XC Guan","year":"2015","unstructured":"Guan, X.C., Pardalos, P.M., Zuo, X.: Inverse max + sum 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":"1170_CR6","first-page":"1","volume":"5","author":"XC Guan","year":"2017","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. 5, 1\u201313 (2017)","journal-title":"Optim. Lett."},{"issue":"1","key":"1170_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-011-9742-x","volume":"54","author":"XC Guan","year":"2012","unstructured":"Guan, X.C., Zhang, B.W.: Inverse 1-median problem on trees under weighted Hamming distance. J. Glob. Optim. 54(1), 75\u201382 (2012)","journal-title":"J. Glob. Optim."},{"key":"1170_CR8","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.1016\/j.cor.2005.12.003","volume":"34","author":"XC Guan","year":"2007","unstructured":"Guan, X.C., Zhang, J.Z.: Inverse constrained bottleneck problems under weighted $$l_{\\infty }$$ norm. Comput. Oper. Res. 34, 3243\u20133254 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1170_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C Heuburger","year":"2004","unstructured":"Heuburger, C.: Inverse optimization, a survey on problems, methods, and results. J. Comb. Optim. 8(3), 329\u2013361 (2004)","journal-title":"J. Comb. Optim."},{"issue":"5","key":"1170_CR10","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."},{"key":"1170_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."},{"key":"1170_CR12","volume-title":"The Complexity of Preprocessing. Research Report of Sloan School of Management","author":"T Lai","year":"2003","unstructured":"Lai, T., Orlin, J.: The Complexity of Preprocessing. Research Report of Sloan School of Management. MIT, Cambridge (2003)"},{"issue":"4","key":"1170_CR13","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":"1170_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10898-008-9294-x","volume":"43","author":"LC Liu","year":"2009","unstructured":"Liu, L.C., 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":"1170_CR15","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":"1170_CR16","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":"2","key":"1170_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10898-019-00852-4","volume":"77","author":"X Li","year":"2020","unstructured":"Li, X., Zhang, Z., Yang, R., Zhang, H., Du, D.-Z.: Approximation algorithms for capacitated partial inverse maximum spanning tree problem. J. Glob. Optim. 77(2), 319\u2013340 (2020)","journal-title":"J. Glob. Optim."},{"key":"1170_CR18","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01589111","volume":"45","author":"M Minoux","year":"1989","unstructured":"Minoux, M.: Solving combinatorial problemswith combined minmax-minsum objective and applications. Math. Program. 45, 361\u2013371 (1989)","journal-title":"Math. Program."},{"issue":"6","key":"1170_CR19","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/0305-0548(94)90084-1","volume":"21","author":"AP Punnen","year":"1994","unstructured":"Punnen, A.P.: On combined minmax-minsum optimization. Comput. Oper. Res. 21(6), 707\u2013716 (1994)","journal-title":"Comput. Oper. Res."},{"key":"1170_CR20","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/0377-2217(94)00252-5","volume":"89","author":"AP Punnen","year":"1996","unstructured":"Punnen, A.P., Nair, K.P.K.: An $$O(m\\log n)$$ algorithm for the max + sum spanning tree problem. Eur. J. Oper. Res. 89, 423\u2013426 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1170_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(2), 291\u2013298 (1999)","journal-title":"Oper. Res."},{"issue":"4","key":"1170_CR22","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s10878-020-00656-3","volume":"40","author":"J Tayyebi","year":"2020","unstructured":"Tayyebi, J., Sepasian, A.R.: Partial inverse min-max spanning tree problem. J. Comb. Optim. 40(4), 1075\u20131091 (2020)","journal-title":"J. Comb. Optim."},{"key":"1170_CR23","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, 123\u2013135 (2007)","journal-title":"J. Comb. Optim."},{"key":"1170_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1013807829021","volume":"6","author":"JZ Zhang","year":"2002","unstructured":"Zhang, J.Z., Liu, Z.: A general model of some inverse combinatorial optimization problems and its solution method under $$l_{\\infty }$$ norm. J. Comb. Optim. 6, 207\u2013227 (2002)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"1170_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 bottlenecktype Hamming distance. J. Glob. Optim. 34(3), 467\u2013474 (2006)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01170-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01170-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01170-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T06:11:55Z","timestamp":1666246315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01170-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,16]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1170"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01170-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,5,16]]},"assertion":[{"value":"6 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}