{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T11:55:09Z","timestamp":1780574109969,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"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"}]},{"DOI":"10.13039\/501100005236","name":"Chinese Universities Scientific Fund","doi-asserted-by":"publisher","award":["2018B44014"],"award-info":[{"award-number":["2018B44014"]}],"id":[{"id":"10.13039\/501100005236","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s10878-021-00721-5","type":"journal-article","created":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T11:02:51Z","timestamp":1617015771000},"page":"861-887","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance"],"prefix":"10.1007","volume":"41","author":[{"given":"Hui","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-1868","authenticated-orcid":false,"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binwu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,29]]},"reference":[{"issue":"1","key":"721_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0515-x","volume":"102","author":"S Ahmed","year":"2005","unstructured":"Ahmed S, Guan YP (2005) The inverse optimal value problem. Math Program 102(1):91\u2013110","journal-title":"Math Program"},{"key":"721_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/jagm.1999.1052","volume":"34","author":"RK Ahuja","year":"2000","unstructured":"Ahuja RK, Orlin JB (2000) A faster algorithm for the inverse spanning tree problem. J Algorithms 34:177\u2013193","journal-title":"J Algorithms"},{"key":"721_CR3","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs"},{"key":"721_CR4","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.ejor.2007.04.031","volume":"188","author":"MC Cai","year":"2008","unstructured":"Cai MC, Duin CW, Yang X, Zhang J (2008) The partial inverse minimum spanning tree problem when weight increase is forbidden. Eur J Oper Res 188:348\u2013353","journal-title":"Eur J Oper Res"},{"key":"721_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/int.22","author":"W Gao","year":"2021","unstructured":"Gao W, Wang W, Chen Y (2021) Tight bounds for the existence of path factors in network vulnerability parameter settings. Int J Intell Syst. https:\/\/doi.org\/10.1002\/int.22","journal-title":"Int J Intell Syst"},{"issue":"1","key":"721_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10898-014-0140-z","volume":"61","author":"XC Guan","year":"2015","unstructured":"Guan XC, Pardalos PM, Zuo X (2015) Inverse max+sum spanning tree problem by modifying the sum-cost vector under weighted $$l_\\infty $$ norm. J Global Optim 61(1):165\u2013182","journal-title":"J Global Optim"},{"issue":"4","key":"721_CR7","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10898-017-0546-5","volume":"69","author":"XC Guan","year":"2017","unstructured":"Guan XC, He XY, Pardalos PM, Zhang BW (2017) Inverse max+sum spanning tree problem under hamming distance by modifying the sum-cost vector. J Global Optim 69(4):911\u2013925","journal-title":"J Global Optim"},{"issue":"5","key":"721_CR8","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s11590-017-1165-2","volume":"12","author":"XC Guan","year":"2018","unstructured":"Guan XC, Pardalos PM, Zhang BW (2018) Inverse max+sum spanning tree problem under weighted $$l_1$$ norm by modifying the sum-cost vector. Optim Lett 12(5):1065\u20131077","journal-title":"Optim Lett"},{"issue":"1","key":"721_CR9","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 BW, Yao EY (2005) Weighted inverse minimum spanning tree problems under Hamming distance. J Comb Optim 9(1):91\u2013100","journal-title":"J Comb Optim"},{"key":"721_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 DS (2003) Efficient algorithms for the inverse spanning-tree problem. Oper Res 51:785\u2013797","journal-title":"Oper Res"},{"key":"721_CR11","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 HJ (2016) Algorithms for constraint partial inverse matroid problem with weight increase forbidden. Theoret Comput Sci 640:119\u2013124","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"721_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s10898-017-0554-5","volume":"70","author":"XY Li","year":"2018","unstructured":"Li XY, Zhang Z, Du DZ (2018) Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$-norm. J Global Optim 70(3):677\u2013685","journal-title":"J Global Optim"},{"issue":"4","key":"721_CR13","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/s10878-019-00433-x","volume":"38","author":"XY Li","year":"2019","unstructured":"Li XY, Shu XC, Huang HJ, Bai JJ (2019) Capacitated partial inverse maximum spanning tree under the weighted Hamming distance. J Comb Optim 38(4):1005\u20131018","journal-title":"J Comb Optim"},{"key":"721_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10898-019-00852-4","volume":"77","author":"XY Li","year":"2020","unstructured":"Li XY, Zhang Z, Yang R et al (2020) Approximation algorithms for capacitated partial inverse maximum spanning tree problem. J Global Optim 77:319\u2013340","journal-title":"J Global Optim"},{"key":"721_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2007.12.006","volume":"396","author":"LC Liu","year":"2008","unstructured":"Liu LC, Yao EY (2008) Inverse min\u2013max spanning tree problem under the weighted sum-type Hamming distance. Theoret Comput Sci 396:28\u201334","journal-title":"Theoret Comput Sci"},{"issue":"1\u20132","key":"721_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.cam.2007.08.005","volume":"220","author":"YB Lv","year":"2008","unstructured":"Lv YB, Hua TS, Wan ZP (2008) A penalty function method for solving inverse optimal value problem. J Comput Appl Math 220(1\u20132):175\u2013180","journal-title":"J Comput Appl Math"},{"key":"721_CR17","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1287\/opre.47.2.291","volume":"47","author":"PT Sokkalingam","year":"1999","unstructured":"Sokkalingam PT, Ahuja RK, Orlin JB (1999) Solving inverse spanning tree problems through network flow techniques. Oper Res 47:291\u2013298","journal-title":"Oper Res"},{"issue":"2","key":"721_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10878-006-9016-6","volume":"13","author":"XG Yang","year":"2007","unstructured":"Yang XG, Zhang JZ (2007) Some inverse min\u2013max network problems under weighted $$l_1$$ and $$l_{\\infty }$$ norms with bound constraints on changes. J Comb Optim 13(2):123\u2013135","journal-title":"J Comb Optim"},{"key":"721_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1080\/02331939608844197","volume":"37","author":"JZ Zhang","year":"1996","unstructured":"Zhang JZ, Ma ZF (1996) A network flow method for solving some inverse combinatorial optimization problems. Optimization 37:59\u201372","journal-title":"Optimization"},{"key":"721_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01194328","volume":"44","author":"JZ Zhang","year":"1996","unstructured":"Zhang JZ, Liu ZH, Ma ZF (1996) On the inverse problem of minimum spanning tree with partition constraints. Math Methods Oper Res 44:171\u2013188","journal-title":"Math Methods Oper Res"},{"key":"721_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"JZ Zhang","year":"1997","unstructured":"Zhang JZ, Xu SJ, Ma ZF (1997) An algorithm for inverse minimum spanning tree problem. Optim Methods Softw 8:69\u201384","journal-title":"Optim Methods Softw"},{"key":"721_CR22","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10898-005-6470-0","volume":"34","author":"BW Zhang","year":"2006","unstructured":"Zhang BW, Zhang JZ, He Y (2006) Constrained inverse minimum spanning tree problems under bottleneck-type Hamming distance. J Global Optim 34:467\u2013474","journal-title":"J Global Optim"},{"issue":"8","key":"721_CR23","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1007\/s11590-020-01553-8","volume":"14","author":"BW Zhang","year":"2020","unstructured":"Zhang BW, Guan XC, Zhang Q (2020) Inverse optimal value problem on minimum spanning tree under unit $$l_{\\infty }$$ norm. Optim Lett 14(8):2301\u20132322","journal-title":"Optim Lett"},{"issue":"3","key":"721_CR24","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s10898-020-00947-3","volume":"79","author":"BW Zhang","year":"2021","unstructured":"Zhang BW, Guan XC, Pardalos PM et al (2021) The lower bounded inverse optimal value problem on minimum spanning tree under unit $$l_{\\infty }$$ norm. J Global Optim 79(3):757\u2013777","journal-title":"J Global Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00721-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00721-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00721-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,26]],"date-time":"2021-05-26T05:05:03Z","timestamp":1622005503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00721-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,29]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["721"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00721-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,29]]},"assertion":[{"value":"2 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}