{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:31:13Z","timestamp":1760646673203,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,7,15]],"date-time":"2017-07-15T00:00:00Z","timestamp":1500076800000},"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":["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":[[2017,12]]},"DOI":"10.1007\/s10898-017-0546-5","type":"journal-article","created":{"date-parts":[[2017,7,15]],"date-time":"2017-07-15T04:31:24Z","timestamp":1500093084000},"page":"911-925","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Inverse max\u00a0 $$+$$ + \u00a0sum spanning tree problem under Hamming distance by modifying the sum-cost vector"],"prefix":"10.1007","volume":"69","author":[{"given":"Xiucui","family":"Guan","sequence":"first","affiliation":[]},{"given":"Xinyan","family":"He","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Binwu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,15]]},"reference":[{"key":"546_CR1","doi-asserted-by":"crossref","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":"1","key":"546_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0304-3975(97)00115-1","volume":"209","author":"E Amaldi","year":"1998","unstructured":"Amaldi, E., Kann, V.: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theor. Comput. Sci. 209(1), 237\u2013260 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"546_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0167-6377(91)90085-4","volume":"10","author":"CW Duin","year":"1991","unstructured":"Duin, C.W., Volgenant, A.: Minimum deviation and balanced optimization: a unified approach. Oper. Res. Lett. 10, 43\u201348 (1991)","journal-title":"Oper. Res. Lett."},{"key":"546_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":"546_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"546_CR6","doi-asserted-by":"crossref","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 $$ l \u221e norm. Comput. Oper. Res. 34, 3243\u20133254 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"546_CR7","doi-asserted-by":"crossref","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\u00a0 $$+$$ + \u00a0Sum 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":"546_CR8","doi-asserted-by":"publisher","unstructured":"Guan, X.C., Pardalos, P.M., Zhang, B.W.: Inverse Max $$+$$ + Sum spanning tree problem by modifying the sum-cost vector under weighted $$l_1$$ l 1 norm. Optim. Lett. (2017). doi: 10.1007\/s11590-017-1165-2","DOI":"10.1007\/s11590-017-1165-2"},{"issue":"1","key":"546_CR9","doi-asserted-by":"crossref","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":"546_CR10","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."},{"issue":"3","key":"546_CR11","doi-asserted-by":"crossref","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":"546_CR12","doi-asserted-by":"crossref","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":"546_CR13","doi-asserted-by":"crossref","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\u2013max spanning tree problems under the weighted Hamming distance. J. Glob. Optim. 43, 83\u201395 (2009)","journal-title":"J. Glob. Optim."},{"key":"546_CR14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-540-74450-4_34","volume":"4614","author":"L Liu","year":"2007","unstructured":"Liu, L., Yao, E.: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance. Lect. Notes Comput. Sci. 4614, 375\u2013383 (2007)","journal-title":"Lect. Notes Comput. Sci."},{"key":"546_CR15","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01589111","volume":"45","author":"M Minoux","year":"1989","unstructured":"Minoux, M.: Solving combinatorial problems with combined minmax\u2013minsum objective and applications. Math. Program. (B) 45, 361\u2013371 (1989)","journal-title":"Math. Program. (B)"},{"issue":"6","key":"546_CR16","doi-asserted-by":"crossref","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\u2013minsum optimization. Comput. Oper. Res. 21(6), 707\u2013716 (1994)","journal-title":"Comput. Oper. Res."},{"key":"546_CR17","doi-asserted-by":"crossref","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)$$ O ( m log n ) algorithm for the max\u00a0 $$+$$ + \u00a0sum spanning tree problem. Eur. J. Oper. Res. 89, 423\u2013426 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"546_CR18","unstructured":"Scheinerman, E.R.: Matgraph is a Matlab toolbox for simple graphs. http:\/\/www.ams.jhu.edu\/~ers\/matgraph\/"},{"key":"546_CR19","doi-asserted-by":"crossref","unstructured":"Schuler, S., Ebenbauer, C., Allg\u00f6wer, F.: $$l_0$$ l 0 -system gain and $$l_1$$ l 1 -optimal control. In: Proceedings of the 18th IFAC World Congress, pp. 9230C\u20139235 (2011)","DOI":"10.3182\/20110828-6-IT-1002.00755"},{"issue":"2","key":"546_CR20","doi-asserted-by":"crossref","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."},{"key":"546_CR21","doi-asserted-by":"crossref","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\u2013max network problems under weighted $$l_1$$ l 1 and $$l_\\infty $$ l \u221e norms with bound constraints on changes. J. Comb. Optim. 13, 123\u2013135 (2007)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"546_CR22","doi-asserted-by":"crossref","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(3), 467\u2013474 (2006)","journal-title":"J. Glob. Optim."},{"key":"546_CR23","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01194328","volume":"44","author":"JZ Zhang","year":"1996","unstructured":"Zhang, J.Z., Liu, Z., Ma, Z.: On the inverse problem of minimum spanning tree with partition constraints. Math. Methods Oper. Res. 44, 171\u2013187 (1996)","journal-title":"Math. Methods Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0546-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-0546-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0546-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T06:35:34Z","timestamp":1569825334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0546-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,15]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["546"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0546-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,7,15]]}}}