{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:58:28Z","timestamp":1753441108201,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071194","12271228"],"award-info":[{"award-number":["12071194","12271228"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic Research Project of Qinghai","award":["2021-ZJ-703"],"award-info":[{"award-number":["2021-ZJ-703"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10878-023-01093-8","type":"journal-article","created":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T21:41:37Z","timestamp":1700170897000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial inverse min\u2013max spanning tree problem under the weighted bottleneck hamming distance"],"prefix":"10.1007","volume":"46","author":[{"given":"Qingzhen","family":"Dong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6311-8888","authenticated-orcid":false,"given":"Xianyue","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"key":"1093_CR1","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"},{"issue":"3","key":"1093_CR2","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/opre.38.3.556","volume":"38","author":"O Ben-Ayed","year":"1990","unstructured":"Ben-Ayed O, Blair CE (1990) Computational difficulties of bilevel linear programming. Oper Res 38(3):556\u2013560","journal-title":"Oper Res"},{"key":"1093_CR3","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 CW, Yang X, Zhang J (2008) The partial inverse minimum spanning tree problem when weight increasing is forbidden. Eur J Oper Res 188:348\u2013353","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1093_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","volume":"7","author":"PM Camerini","year":"1978","unstructured":"Camerini PM (1978) The min\u2013max spanning tree problem and some extensions. Inf Process Lett 7(1):10\u201314","journal-title":"Inf Process Lett"},{"key":"1093_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1051\/ro\/2010017","volume":"44","author":"E Gassner","year":"2010","unstructured":"Gassner E (2010) The partial inverse minimum cut problem with $$L_1$$-norm is strongly NP-hard. RAIRO Oper Res 44:241\u2013249","journal-title":"RAIRO Oper Res"},{"issue":"4","key":"1093_CR6","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10898-017-0546-5","volume":"69","author":"X Guan","year":"2017","unstructured":"Guan X, He X, Pardalos PM, Zhang B (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":"1093_CR7","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s11590-017-1165-2","volume":"12","author":"X Guan","year":"2018","unstructured":"Guan X, Pardalos PM, Zhang B (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":"1093_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10898-014-0140-z","volume":"61","author":"X Guan","year":"2015","unstructured":"Guan X, 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"},{"key":"1093_CR9","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.1016\/j.cor.2005.12.003","volume":"34","author":"X Guan","year":"2007","unstructured":"Guan X, Zhang J (2007) Inverse constrained bottleneck problems under weighted $$l_\\infty $$ norm. Comput Oper Res 34:3243\u20133254","journal-title":"Comput Oper Res"},{"key":"1093_CR10","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P Hansen","year":"1992","unstructured":"Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13:1194\u20131217","journal-title":"SIAM J Sci Stat Comput"},{"key":"1093_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 (2005) Weighted inverse minimum spanning tree problems under hamming distance. J Comb Optim 9:91\u2013100","journal-title":"J Comb Optim"},{"issue":"5","key":"1093_CR12","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(5):785\u2013797","journal-title":"Oper Res"},{"key":"1093_CR13","series-title":"Research Report of Sloan School of Management","volume-title":"The complexity of preprocessing","author":"T Lai","year":"2003","unstructured":"Lai T, Orlin J (2003) The complexity of preprocessing. Research Report of Sloan School of Management. MIT, Cambridge"},{"key":"1093_CR14","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 (2016) Algorithms for constraint partial inverse matroid problem with weight increase forbidden. Theoret Comput Sci 640:119\u2013124","journal-title":"Theoret Comput Sci"},{"key":"1093_CR15","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 (2019) Capacitated partial inverse maximum spanning tree under the weighted Hamming distance. J Comb Optim 38:1005\u20131018","journal-title":"J Comb Optim"},{"key":"1093_CR16","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 (2018) Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$-norm. J Global Optim 30:677\u2013685","journal-title":"J Global Optim"},{"issue":"2","key":"1093_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 (2020) Approximation algorithms for capacitated partial inverse maximum spanning tree problem. J Global Optim 77(2):319\u2013340","journal-title":"J Global Optim"},{"key":"1093_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10898-008-9294-x","volume":"43","author":"L Liu","year":"2009","unstructured":"Liu L, Wang Q (2009) Constrained inverse min-max spanning tree problems under the weighted Hamming distance. J Global Optim 43:83\u201395","journal-title":"J Global Optim"},{"key":"1093_CR19","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2007.12.006","volume":"196","author":"L Liu","year":"2008","unstructured":"Liu L, Yao E (2008) Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance. Theoret Comput Sci 196:28\u201334","journal-title":"Theoret Comput Sci"},{"key":"1093_CR20","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"},{"key":"1093_CR21","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 AR (2020) Partial inverse min-max spanning tree problem. J Comb Optim 40:1075\u20131091","journal-title":"J Comb Optim"},{"key":"1093_CR22","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/s10878-021-00721-5","volume":"41","author":"H Wang","year":"2021","unstructured":"Wang H, Guan X, Zhang Q, Zhang B (2021) Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance. J Comb Optim 41:861\u2013887","journal-title":"J Comb Optim"},{"key":"1093_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1051\/ro:2001106","volume":"35","author":"X Yang","year":"2001","unstructured":"Yang X (2001) Complexity of partial inverse assignment problem and partial inverse cut problem. RAIRO Oper Res 35:117\u2013126","journal-title":"RAIRO Oper Res"},{"key":"1093_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.orl.2005.12.003","volume":"35","author":"X Yang","year":"2007","unstructured":"Yang X, Zhang J (2007) Partial inverse assignment problem under $$l_1$$ norm. Oper Res Lett 35:23\u201328","journal-title":"Oper Res Lett"},{"issue":"1","key":"1093_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10589-006-0394-6","volume":"36","author":"X Yang","year":"2007","unstructured":"Yang X, Zhang J (2007) Inverse sorting problem by minimizing the total weighted number of changers and partial inverse sorting problem. Comput Optim Appl 36(1):55\u201366","journal-title":"Comput Optim Appl"},{"issue":"2","key":"1093_CR26","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10878-006-9016-6","volume":"13","author":"X Yang","year":"2007","unstructured":"Yang X, Zhang J (2007) Some inverse min-max 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"},{"issue":"8","key":"1093_CR27","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1007\/s11590-020-01553-8","volume":"14","author":"B Zhang","year":"2020","unstructured":"Zhang B, Guan X, 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"},{"key":"1093_CR28","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 (2006) Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance. J Global Optim 34:467\u2013474","journal-title":"J Global Optim"},{"issue":"1","key":"1093_CR29","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"J Zhang","year":"1997","unstructured":"Zhang J, Xu S, Ma Z (1997) An algorithm for inverse minimum spanning tree problem. Optim Methods Softw 8(1):69\u201384","journal-title":"Optim Methods Softw"},{"issue":"4","key":"1093_CR30","doi-asserted-by":"publisher","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, Du D-Z (2016) Algorithms for the partial inverse matroid problem in which weights can only be increased. J Global Optim 65(4):801\u2013811","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-023-01093-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01093-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01093-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T08:18:53Z","timestamp":1700641133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01093-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1093"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01093-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,11]]},"assertion":[{"value":"31 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"27"}}