{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T09:53:29Z","timestamp":1781776409714,"version":"3.54.5"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T00:00:00Z","timestamp":1601164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T00:00:00Z","timestamp":1601164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10878-020-00656-3","type":"journal-article","created":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T05:02:21Z","timestamp":1601182941000},"page":"1075-1091","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Partial inverse min\u2013max spanning tree problem"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7559-3870","authenticated-orcid":false,"given":"Javad","family":"Tayyebi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali Reza","family":"Sepasian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,27]]},"reference":[{"key":"656_CR1","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, USA"},{"issue":"1","key":"656_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(1):177\u2013193","journal-title":"J Algorithms"},{"issue":"5","key":"656_CR3","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"RK Ahuja","year":"2001","unstructured":"Ahuja RK, Orlin JB (2001) Inverse optimization. Oper Res 49(5):771\u2013783","journal-title":"Oper Res"},{"issue":"10","key":"656_CR4","doi-asserted-by":"publisher","first-page":"105004","DOI":"10.1088\/1361-6560\/aabd14","volume":"63","author":"A Babier","year":"2018","unstructured":"Babier A, Boutilier JJ, Sharpe MB, McNiven AL, Chan TC (2018) Inverse optimization of objective function weights for treatment planning using clinical dose-volume histograms. Phys Med Biol 63(10):105004","journal-title":"Phys Med Biol"},{"issue":"2","key":"656_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF00941574","volume":"68","author":"JF Bard","year":"1991","unstructured":"Bard JF (1991) Some properties of the bilevel programming problem. J Optim Theory Appl 68(2):371\u2013378","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"656_CR6","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1287\/opre.2017.1606","volume":"65","author":"JR Birge","year":"2017","unstructured":"Birge JR, Horta\u00e7su A, Pavlin JM (2017) Inverse optimization for the recovery of market structure from market outcomes: an application to the miso electricity market. Oper Res 65(4):837\u2013855","journal-title":"Oper Res"},{"issue":"2","key":"656_CR7","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(2):348\u2013353","journal-title":"Eur J Oper Res"},{"issue":"1","key":"656_CR8","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"},{"issue":"1","key":"656_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2018.02.045","volume":"270","author":"TC Chan","year":"2018","unstructured":"Chan TC, Lee T (2018) Trade-off preservation in inverse multi-objective convex optimization. Eur J Oper Res 270(1):25\u201339","journal-title":"Eur J Oper Res"},{"key":"656_CR10","first-page":"547","volume-title":"Paradigms of combinatorial optimization (problems and new approaches)","author":"M Demange","year":"2010","unstructured":"Demange M, Monnot J (2010) An introduction to inverse combinatorial problems. In: Paschos VT (ed) Paradigms of combinatorial optimization (problems and new approaches). ISTE-WILEY, London-Hoboken (UK-USA), pp 547\u2013586"},{"key":"656_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-0-387-88843-9_4","volume-title":"Operations research and cyber-infrastructure","author":"ST DeNegre","year":"2009","unstructured":"DeNegre ST, Ralphs TK (2009) A branch-and-cut algorithm for integer bilevel linear programs. In: Chinneck JW, Kristjansson B, Saltzman MJ (eds) Operations research and cyber-infrastructure. Springer, Boston, pp 65\u201378"},{"key":"656_CR12","first-page":"482","volume":"2","author":"P Erd\u00f5s","year":"1976","unstructured":"Erd\u00f5s P, R\u00e9nyi A (1976) On the evolution of random graphs. Sel Pap Alfr\u00e9d R\u00e9nyi 2:482\u2013525","journal-title":"Sel Pap Alfr\u00e9d R\u00e9nyi"},{"key":"656_CR13","unstructured":"Gentry S (2001) Partial inverse linear programming, MIT Lab for information and decision systems report, LIDS-P-2532, Dec"},{"issue":"3","key":"656_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.orl.2018.03.007","volume":"46","author":"K Ghobadi","year":"2018","unstructured":"Ghobadi K, Lee T, Mahmoudzadeh H, Terekhov D (2018) Robust inverse optimization. Oper Res Lett 46(3):339\u2013344","journal-title":"Oper Res Lett"},{"issue":"1","key":"656_CR15","doi-asserted-by":"crossref","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":"656_CR16","doi-asserted-by":"crossref","unstructured":"Hartmann T, Wagner D (2012) Fast and simple fully-dynamic cut tree construction. In: International symposium on algorithms and computation. Springer, Berlin, pp 95\u2013105","DOI":"10.1007\/978-3-642-35261-4_13"},{"issue":"1","key":"656_CR17","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(1):91\u2013100","journal-title":"J Comb Optim"},{"issue":"3","key":"656_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C Heuberger","year":"2004","unstructured":"Heuberger C (2004) Inverse combinatorial optimization: A survey on problems, methods, and results. J Comb Optim 8(3):329\u2013361","journal-title":"J Comb Optim"},{"issue":"5","key":"656_CR19","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":"656_CR20","unstructured":"Lai TC, Orlin JB (2003). The complexity of preprocessing. Research report of Sloan School of Mangement"},{"issue":"3","key":"656_CR21","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/s10898-017-0554-5","volume":"70","author":"X Li","year":"2018","unstructured":"Li X, Zhang Z, Du DZ (2018) Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$-norm. J Glob Optim 70(3):677\u2013685","journal-title":"J Glob Optim"},{"key":"656_CR22","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-74450-4_34","volume-title":"Combinatorics, algorithms, probabilistic and experimental methodologies","author":"L Liu","year":"2007","unstructured":"Liu L, Yao E (2007) Inverse min\u2013max spanning tree problem under the weighted sum-type Hamming distance. In: Chen B, Paterson M, Zhang G (eds) Combinatorics, algorithms, probabilistic and experimental methodologies. Springer, Berlin, pp 375\u2013383"},{"issue":"1","key":"656_CR23","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(1):83\u201395","journal-title":"J Glob Optim"},{"key":"656_CR24","first-page":"503","volume-title":"Handbooks in operations research and management science","author":"TL Magnanti","year":"1995","unstructured":"Magnanti TL, Wolsey LA (1995) Optimal trees. In: Birge J, Linetsky V (eds) Handbooks in operations research and management science, vol 7. Elsevier, Amsterdam, pp 503\u2013615"},{"key":"656_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.05.017","author":"PC Pop","year":"2019","unstructured":"Pop PC (2019) The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2019.05.017","journal-title":"Eur J Oper Res"},{"issue":"5","key":"656_CR26","doi-asserted-by":"publisher","first-page":"4805","DOI":"10.1109\/TSG.2017.2671743","volume":"9","author":"J Saez-Gallego","year":"2018","unstructured":"Saez-Gallego J, Morales JM (2018) Short-term forecasting of price-responsive loads using inverse optimization. IEEE Trans Smart Grid 9(5):4805\u20134814","journal-title":"IEEE Trans Smart Grid"},{"issue":"3","key":"656_CR27","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator DD, Tarjan RE (1983) A data structure for dynamic trees. J Comput Syst Sci 26(3):362\u2013391","journal-title":"J Comput Syst Sci"},{"key":"656_CR28","unstructured":"Sokkalingam PT, Ahuja RK, Orlin JB (1996) Inverse spanning tree problems: formulations and algorithms, Working Paper #3890-96, MIT Sloan School of Management"},{"key":"656_CR29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717921","volume-title":"Inverse problem theory and methods for model parameter estimation","author":"A Tarantola","year":"2005","unstructured":"Tarantola A (2005) Inverse problem theory and methods for model parameter estimation, vol 89. SIAM, New Delhi"},{"issue":"2","key":"656_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01539860","volume":"20","author":"C Yang","year":"1998","unstructured":"Yang C, Zhang J (1998) Inverse maximum capacity problems. Oper Res Spektrum 20(2):97\u2013100","journal-title":"Oper Res Spektrum"},{"key":"656_CR31","unstructured":"Zeng B, An Y (2014) Solving bilevel mixed integer program by reformulations and decomposition. http:\/\/www.optimizationonline.org\/DB_FILE\/2014\/07\/4455.pdf. Accessed 20 Aug 2016"},{"issue":"2","key":"656_CR32","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01194328","volume":"44","author":"J Zhang","year":"1996","unstructured":"Zhang J, Liu Z, Ma Z (1996) On the inverse problem of minimum spanning tree with partition constraints. Math Methods Oper Res 44(2):171\u2013187","journal-title":"Math Methods Oper Res"},{"issue":"1","key":"656_CR33","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":"3","key":"656_CR34","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(3):467\u2013474","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-020-00656-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00656-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00656-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,26]],"date-time":"2021-09-26T23:47:07Z","timestamp":1632700027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00656-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,27]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["656"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00656-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,27]]},"assertion":[{"value":"22 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}