{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T11:01:27Z","timestamp":1753441287116,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T00:00:00Z","timestamp":1661817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T00:00:00Z","timestamp":1661817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Basic Research Project of Qinghai","award":["2021-ZJ-703"],"award-info":[{"award-number":["2021-ZJ-703"]}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LD19A010001"],"award-info":[{"award-number":["LD19A010001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U20A2068","11771013"],"award-info":[{"award-number":["U20A2068","11771013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071194","11871256"],"award-info":[{"award-number":["12071194","11871256"]}],"id":[{"id":"10.13039\/501100001809","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":[[2022,12]]},"DOI":"10.1007\/s10878-022-00903-9","type":"journal-article","created":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T23:06:44Z","timestamp":1661900804000},"page":"3331-3350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial inverse maximum spanning tree problem under the Chebyshev norm"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6311-8888","authenticated-orcid":false,"given":"Xianyue","family":"Li","sequence":"first","affiliation":[]},{"given":"Ruowang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"issue":"3","key":"903_CR1","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":"903_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, New York"},{"key":"903_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"},{"key":"903_CR4","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":"903_CR5","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 Glob Optim 69(4):911\u2013925","journal-title":"J Glob Optim"},{"issue":"5","key":"903_CR6","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":"903_CR7","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 Glob Optim 61(1):165\u2013182","journal-title":"J Glob Optim"},{"key":"903_CR8","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":"903_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 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":"903_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(5):785\u2013797","journal-title":"Oper Res"},{"issue":"2","key":"903_CR11","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1137\/S0895480100369584","volume":"16","author":"DS Hochbaum","year":"2003","unstructured":"Hochbaum DS, Queyranne M (2003) Minimizing a convex cost closure set. SIAM J Discrete Math 16(2):192\u2013207","journal-title":"SIAM J Discrete Math"},{"key":"903_CR12","volume-title":"The complexity of preprocessing. Research Report of Sloan School of Management","author":"T Lai","year":"2003","unstructured":"Lai T, Orlin J (2003) The complexity of preprocessing. Research Report of Sloan School of Management. MIT"},{"key":"903_CR13","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. Theor Comput Sci 640:119\u2013124","journal-title":"Theor Comput Sci"},{"key":"903_CR14","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":"903_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 (2018) Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$-norm. J Glob Optim 30:677\u2013685","journal-title":"J Glob Optim"},{"issue":"2","key":"903_CR16","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 Glob Optim 77(2):319\u2013340","journal-title":"J Glob Optim"},{"key":"903_CR17","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\u2013max spanning tree problems under the weighted Hamming distance. J Glob Optim 43:83\u201395","journal-title":"J Glob Optim"},{"key":"903_CR18","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\u2013max spanning tree problem under the Weighted sum-type Hamming distance. Theor Comput Sci 196:28\u201334","journal-title":"Theor Comput Sci"},{"key":"903_CR19","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":"903_CR20","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\u2013max spanning tree problem. J Comb Optim 40:1075\u20131091","journal-title":"J Comb Optim"},{"key":"903_CR21","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":"903_CR22","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":"903_CR23","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":"903_CR24","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":"8","key":"903_CR25","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":"903_CR26","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 Glob Optim 34:467\u2013474","journal-title":"J Glob Optim"},{"issue":"1","key":"903_CR27","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":"903_CR28","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 Glob Optim 65(4):801\u2013811","journal-title":"J Glob Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00903-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00903-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00903-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T09:39:03Z","timestamp":1667036343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00903-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,30]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["903"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00903-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,8,30]]},"assertion":[{"value":"20 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2022","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"}}]}}