The Value of Randomized Strategies in Distributionally Robust Risk-Averse Network Interdiction Problems

DOI10.1287/IJOC.2022.1257arXiv2003.07915OpenAlexW4311705215MaRDI QIDQ6202875

Utsav Sadana, Erick Delage

Publication date: 27 February 2024

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.07915

zbMATH Keywords

column generationconditional value at risknetwork interdictiondistributionally robust optimizationspatial branch-and-bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Robustness in mathematical programming (90C17)

This page was built for publication: The Value of Randomized Strategies in Distributionally Robust Risk-Averse Network Interdiction Problems