{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T21:03:41Z","timestamp":1781298221168,"version":"3.54.1"},"reference-count":60,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:00:00Z","timestamp":1778544000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107533","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:01:43Z","timestamp":1778601703000},"page":"107533","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Data-driven interdiction with asymmetric cost uncertainty: A distributionally robust optimization approach"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9417-6661","authenticated-orcid":false,"given":"Sergey S.","family":"Ketkov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2888-8630","authenticated-orcid":false,"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cor.2026.107533_b1","first-page":"346","article-title":"Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction","volume":"32","author":"Atamt\u00fcrk","year":"2020","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b2","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s10479-023-05350-1","article-title":"Shortest path network interdiction with incomplete information: a robust optimization approach","volume":"335","author":"Azizi","year":"2024","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2026.107533_b3","series-title":"The Elements of Integration and Lebesgue Measure","author":"Bartle","year":"2014"},{"issue":"4","key":"10.1016\/j.cor.2026.107533_b4","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/s12532-023-00244-6","article-title":"Exact methods for discrete \u03b3-robust interdiction problems with an application to the bilevel knapsack problem","volume":"15","author":"Beck","year":"2023","journal-title":"Math. Program. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b5","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2023.01.008","article-title":"A survey on bilevel optimization under uncertainty","volume":"311","author":"Beck","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107533_b6","series-title":"Robust Optimization","author":"Ben-Tal","year":"2009"},{"issue":"3","key":"10.1016\/j.cor.2026.107533_b7","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","article-title":"Robust optimization\u2013methodology and applications","volume":"92","author":"Ben-Tal","year":"2002","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107533_b8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10107-017-1125-8","article-title":"Data-driven robust optimization","volume":"167","author":"Bertsimas","year":"2018","journal-title":"Math. Program."},{"issue":"1\u20133","key":"10.1016\/j.cor.2026.107533_b9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","article-title":"Robust discrete optimization and network flows","volume":"98","author":"Bertsimas","year":"2003","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107533_b10","series-title":"Introduction To Stochastic Programming","author":"Birge","year":"2011"},{"issue":"9","key":"10.1016\/j.cor.2026.107533_b11","doi-asserted-by":"crossref","first-page":"6382","DOI":"10.1287\/mnsc.2021.4155","article-title":"Distributionally robust mean\u2013variance portfolio selection with Wasserstein distances","volume":"68","author":"Blanchet","year":"2022","journal-title":"Manag. Sci."},{"key":"10.1016\/j.cor.2026.107533_b12","series-title":"Mixed-integer bilevel optimization with nonconvex quadratic lower-level problems: Complexity and a solution method","author":"Bomze","year":"2025"},{"issue":"1","key":"10.1016\/j.cor.2026.107533_b13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/deca.2015.0325","article-title":"Sequential shortest path interdiction with incomplete information","volume":"13","author":"Borrero","year":"2016","journal-title":"Decis. Anal."},{"issue":"1","key":"10.1016\/j.cor.2026.107533_b14","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1287\/opre.2018.1773","article-title":"Sequential interdiction with incomplete information and learning","volume":"67","author":"Borrero","year":"2019","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b15","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1287\/ijoo.2021.0063","article-title":"Learning in sequential bilevel linear programming","volume":"4","author":"Borrero","year":"2022","journal-title":"INFORMS J. Optim."},{"issue":"5","key":"10.1016\/j.cor.2026.107533_b16","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.orl.2021.07.009","article-title":"On the complexity of robust bilevel optimization with uncertain follower\u2019s objective","volume":"49","author":"Buchheim","year":"2021","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.cor.2026.107533_b17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","article-title":"Uncertain convex programs: randomized solutions and confidence levels","volume":"102","author":"Calafiore","year":"2005","journal-title":"Math. Program."},{"issue":"5","key":"10.1016\/j.cor.2026.107533_b18","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TAC.2006.875041","article-title":"The scenario approach to robust control design","volume":"51","author":"Calafiore","year":"2006","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b19","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/s10479-023-05812-6","article-title":"Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption","volume":"335","author":"Chauhan","year":"2024","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107533_b20","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1287\/opre.2022.2330","article-title":"Data-driven chance constrained programs over Wasserstein balls","volume":"72","author":"Chen","year":"2024","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107533_b21","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","article-title":"An overview of bilevel optimization","volume":"153","author":"Colson","year":"2007","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b22","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/opre.46.2.184","article-title":"Stochastic network interdiction","volume":"46","author":"Cormican","year":"1998","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107533_b23","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.1090.0741","article-title":"Distributionally robust optimization under moment uncertainty with application to data-driven problems","volume":"58","author":"Delage","year":"2010","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107533_b24","series-title":"Foundations of Bilevel Programming","author":"Dempe","year":"2002"},{"key":"10.1016\/j.cor.2026.107533_b25","series-title":"International Conference on Integer Programming and Combinatorial Optimization","first-page":"157","article-title":"Packing interdiction and partial covering problems","author":"Dinitz","year":"2013"},{"issue":"1\u20132","key":"10.1016\/j.cor.2026.107533_b26","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","article-title":"Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations","volume":"171","author":"Esfahani","year":"2018","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107533_b27","doi-asserted-by":"crossref","unstructured":"Fioretto, F., Mitridati, L., Van Hentenryck, P., 2020. Differential privacy for Stackelberg games. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI-20, pp. 3480\u20133486.","DOI":"10.24963\/ijcai.2020\/481"},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b28","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1287\/moor.2022.1275","article-title":"Distributionally robust stochastic optimization with Wasserstein distance","volume":"48","author":"Gao","year":"2023","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cor.2026.107533_b29","series-title":"International Conference on Integer Programming and Combinatorial Optimization","first-page":"256","article-title":"Completeness in the polynomial hierarchy for many natural problems in bilevel and robust optimization","author":"Gr\u00fcne","year":"2025"},{"issue":"5","key":"10.1016\/j.cor.2026.107533_b30","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1137\/0913069","article-title":"New branch-and-bound rules for linear bilevel programming","volume":"13","author":"Hansen","year":"1992","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b31","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.10039","article-title":"Shortest-path network interdiction","volume":"40","author":"Israeli","year":"2002","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.cor.2026.107533_b32","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1002\/net.20237","article-title":"Reformulation and sampling to solve a stochastic network interdiction problem","volume":"52","author":"Janjarassuk","year":"2008","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b33","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01586088","article-title":"The polynomial hierarchy and a simple model for competitive analysis","volume":"32","author":"Jeroslow","year":"1985","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107533_b34","first-page":"1","article-title":"Distributionally risk-receptive and robust multistage stochastic integer programs and interdiction models","author":"Kang","year":"2025","journal-title":"Math. Program."},{"issue":"7","key":"10.1016\/j.cor.2026.107533_b35","first-page":"52","article-title":"On a space of totally additive functions","volume":"13","author":"Kantorovich","year":"1958","journal-title":"Vestn. St. Petersb. Univ.: Math."},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b36","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/j.ejor.2023.10.018","article-title":"A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data","volume":"313","author":"Ketkov","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107533_b37","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejco.2021.100007","article-title":"A survey on mixed-integer programming techniques in bilevel optimization","volume":"9","author":"Kleinert","year":"2021","journal-title":"EURO J. Comput. Optim."},{"key":"10.1016\/j.cor.2026.107533_b38","series-title":"Operations Research & Management Science in the Age of Analytics","first-page":"130","article-title":"Wasserstein distributionally robust optimization: Theory and applications in machine learning","author":"Kuhn","year":"2019"},{"key":"10.1016\/j.cor.2026.107533_b39","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cor.2017.09.004","article-title":"Stochastic maximum flow interdiction problems under heterogeneous risk preferences","volume":"90","author":"Lei","year":"2018","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107533_b40","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/07408170600729192","article-title":"Algorithms for discrete and continuous multicommodity flow network interdiction problems","volume":"39","author":"Lim","year":"2007","journal-title":"IIE Trans."},{"key":"10.1016\/j.cor.2026.107533_b41","series-title":"2022 17th International Conference on Probabilistic Methods Applied To Power Systems","first-page":"1","article-title":"Differentially-private heat and electricity markets coordination","author":"Mitridati","year":"2022"},{"issue":"3","key":"10.1016\/j.cor.2026.107533_b42","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1080\/10556780802712889","article-title":"Cutting-set methods for robust convex optimization with pessimizing oracles","volume":"24","author":"Mutapcic","year":"2009","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"10.1016\/j.cor.2026.107533_b43","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ejor.2021.04.055","article-title":"Network interdiction with asymmetric cost uncertainty","volume":"297","author":"Nguyen","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107533_b44","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/net.21831","article-title":"Stochastic network interdiction with incomplete preference","volume":"73","author":"Pay","year":"2019","journal-title":"Networks"},{"key":"10.1016\/j.cor.2026.107533_b45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5802\/ojmo.15","article-title":"Frameworks and results in distributionally robust optimization","volume":"3","author":"Rahimian","year":"2022","journal-title":"Open J. Math. Optim."},{"key":"10.1016\/j.cor.2026.107533_b46","doi-asserted-by":"crossref","first-page":"21","DOI":"10.21314\/JOR.2000.038","article-title":"Optimization of conditional value-at-risk","volume":"2","author":"Rockafellar","year":"2000","journal-title":"J. Risk"},{"issue":"1","key":"10.1016\/j.cor.2026.107533_b47","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1287\/ijoc.2022.1257","article-title":"The value of randomized strategies in distributionally robust risk-averse network interdiction problems","volume":"35","author":"Sadana","year":"2023","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107533_b48","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/TPWRS.2004.825888","article-title":"Analysis of electric grid security under terrorist threat","volume":"19","author":"Salmeron","year":"2004","journal-title":"IEEE Trans. Power Syst."},{"key":"10.1016\/j.cor.2026.107533_b49","series-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"Shapiro","year":"2021"},{"key":"10.1016\/j.cor.2026.107533_b50","series-title":"Pareto optimality, game theory and equilibria","first-page":"609","article-title":"Algorithms for network interdiction and fortification games","author":"Smith","year":"2008"},{"key":"10.1016\/j.cor.2026.107533_b51","series-title":"Handbook of Combinatorial Optimization","first-page":"1949","article-title":"Modern network interdiction problems and algorithms","author":"Smith","year":"2013"},{"issue":"3","key":"10.1016\/j.cor.2026.107533_b52","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.ejor.2019.06.024","article-title":"A survey of network interdiction models and algorithms","volume":"283","author":"Smith","year":"2020","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107533_b53","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/ijoc.2016.0699","article-title":"Risk-averse shortest path interdiction","volume":"28","author":"Song","year":"2016","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107533_b54","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2020.01.009","article-title":"Wasserstein distributionally robust shortest path problem","volume":"284","author":"Wang","year":"2020","journal-title":"European J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107533_b55","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1287\/opre.2014.1314","article-title":"Distributionally robust convex optimization","volume":"62","author":"Wiesemann","year":"2014","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107533_b56","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1137\/120864015","article-title":"Pessimistic bilevel optimization","volume":"23","author":"Wiesemann","year":"2013","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cor.2026.107533_b57","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10479-017-2694-x","article-title":"A note on linearized reformulations for a class of bilevel linear integer problems","volume":"272","author":"Zare","year":"2019","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107533_b58","first-page":"1128","article-title":"A practical scheme to compute the pessimistic bilevel optimization problem","volume":"32","author":"Zeng","year":"2020","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107533_b59","series-title":"Solving bilevel mixed integer program by reformulations and decomposition","first-page":"1","author":"Zeng","year":"2014"},{"issue":"15","key":"10.1016\/j.cor.2026.107533_b60","doi-asserted-by":"crossref","first-page":"1676","DOI":"10.1016\/j.dam.2010.06.006","article-title":"Matching interdiction","volume":"158","author":"Zenklusen","year":"2010","journal-title":"Discrete Appl. Math."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001516?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001516?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T20:40:15Z","timestamp":1781296815000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":60,"alternative-id":["S0305054826001516"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107533","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Data-driven interdiction with asymmetric cost uncertainty: A distributionally robust optimization approach","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107533","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107533"}}