{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:01:26Z","timestamp":1753437686932,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T00:00:00Z","timestamp":1498262400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11590-017-1165-2","type":"journal-article","created":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T06:51:49Z","timestamp":1498287109000},"page":"1065-1077","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Inverse max+sum spanning tree problem under weighted \n                $$l_1$$\n                \n                    \n                        \n                            l\n                            1\n                        \n                    \n                \n             norm by modifying the sum-cost vector"],"prefix":"10.1007","volume":"12","author":[{"given":"Xiucui","family":"Guan","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Binwu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,24]]},"reference":[{"key":"1165_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":"5","key":"1165_CR2","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 optimization. Oper. Res. 49(5), 771\u2013783 (2001)","journal-title":"Oper. Res."},{"key":"1165_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":"1165_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":"1165_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ejor.2012.07.024","volume":"224","author":"J Gondzioa","year":"2013","unstructured":"Gondzioa, J., Gonz\u00e1lez-Brevisa, P., Munarib, P.: New developments in the primal-dual column generation technique. Eur. J. Oper. Res. 224, 41\u201351 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"1165_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 \n                        $$l_\\infty $$\n                        \n                            \n                                \n                                    l\n                                    \u221e\n                                \n                            \n                        \n                     norm. Comput. Oper. Res. 34, 3243\u20133254 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1165_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+ sum spanning tree problem by modifying the sum-cost vector under weighted \n                        $$l_\\infty $$\n                        \n                            \n                                \n                                    l\n                                    \u221e\n                                \n                            \n                        \n                     Norm. J. Glob. Optim. 61(1), 165\u2013182 (2015)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1165_CR8","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":"1165_CR9","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":"1165_CR10","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":"1165_CR11","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":"1165_CR12","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":"1165_CR13","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\u2013max 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":"1165_CR14","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-minsum objective and applications. Math. Progr. Ser. B 45, 361\u2013371 (1989)","journal-title":"Math. Progr. Ser. B"},{"issue":"6","key":"1165_CR15","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-minsum optimization. Comput. Oper. Res. 21(6), 707\u2013716 (1994)","journal-title":"Comput. Oper. Res."},{"key":"1165_CR16","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 \n                        $$O(m \\log n)$$\n                        \n                            \n                                \n                                    O\n                                    (\n                                    m\n                                    log\n                                    n\n                                    )\n                                \n                            \n                        \n                     algorithm for the max+sum spanning tree problem. Eur. J. Oper. Res. 89, 423\u2013426 (1996)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Scheinerman E.R., Matgraph is a Matlab toolbox for simple graphs. \n                        http:\/\/www.ams.jhu.edu\/~ers\/matgraph\/","key":"1165_CR17"},{"issue":"2","key":"1165_CR18","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":"1165_CR19","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/0377-2217(94)00335-1","volume":"91","author":"T Yamada","year":"1996","unstructured":"Yamada, T., Takahashi, H., Kataoka, S.: A heuristic algorithm for the mini\u2013max spanning forest problem. Eur. J. Oper. Res. 91, 565\u2013572 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"1165_CR20","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 \n                        $$l_1$$\n                        \n                            \n                                \n                                    l\n                                    1\n                                \n                            \n                        \n                     and \n                        $$l_\\infty $$\n                        \n                            \n                                \n                                    l\n                                    \u221e\n                                \n                            \n                        \n                     norms with bound constraints on changes. J. Comb. Optim. 13, 123\u2013135 (2007)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"1165_CR21","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":"1165_CR22","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":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1165-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T01:58:39Z","timestamp":1530151119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1165-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,24]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1165"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1165-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2017,6,24]]}}}